A two-level method or production planning ana scheduling tor Bi-objective reentrant hybrid flow shops

被引:36
作者
Cho, Hang-Min [1 ]
Jeong, In-Jae [1 ]
机构
[1] Hanyang Univ, Dept Ind Engn, 222 Wangshimniro, Seoul 133791, South Korea
关键词
Bi-objective; Reentrant hybrid flow shop; Genetic algorithm; Delayed customer demand; Hierarchical planning; SEMICONDUCTOR FABRICATION; GENETIC ALGORITHM; OPTIMIZATION; BALANCE; LINE;
D O I
10.1016/j.cie.2017.02.010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This research deals with a two-level method of production planning and scheduling problems of the reentrant hybrid flow shops. The hybrid flow shop has serial stages where each stage consists of identical parallel machines. Products can be processed at any one of the parallel machines at a stage in the hybrid flow shop. Also a product may have reentrant operations which require revisits of some stages several times. We consider a two-level hierarchical process on production planning and scheduling of the reentrant hybrid flow shop with the bi-objective function to improve productivity and customer satisfaction. Computational experiments show that the combination of preemptive goal programming based production planning algorithms and Pareto genetic based scheduling algorithms outperforms other two-level algorithms. Also we provide results of the application of the proposed method to both randomly generated problems and a real world Thin Film Transistor and Liquid Crystal Display (TFT-LCD) industry. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:174 / 181
页数:8
相关论文
共 23 条
[1]   Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study [J].
Alfieri, A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (18) :5129-5145
[2]  
[Anonymous], P INT C MOD AN SEM M
[3]  
Cho H.-M., 2012, J SOC KOREA IND SYST, V35, P240
[4]   Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm [J].
Cho, Hang-Min ;
Bae, Suk-Joo ;
Kim, Jungwuk ;
Jeong, In-Jae .
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) :529-541
[5]   Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates [J].
Choi, Hyun-Seon ;
Kim, Hyung-Won ;
Lee, Dong-Ho ;
Yoon, Junggee ;
Yun, Chang Yeon ;
Chae, Kevin B. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 42 (9-10) :963-973
[6]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]   New multi-objective method to solve reentrant hybrid flow shop scheduling problem [J].
Dugardin, Frederic ;
Yalaoui, Farouk ;
Amodeo, Lionel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) :22-31
[8]   Production-flow-value-based job dispatching method for semiconductor manufacturing [J].
Hsieh, Suhua ;
Hou, Kai-Chung .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 30 (7-8) :727-737
[9]   Make-to-order scheduling in foundry semiconductor fabrication [J].
Kang, Kyung Hwan ;
Lee, Young Hoon .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (03) :615-630
[10]   Shift scheduling for steppers in the semiconductor wafer fabrication process [J].
Kim, S ;
Yea, SH ;
Kim, B .
IIE TRANSACTIONS, 2002, 34 (02) :167-177