Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy

被引:47
作者
Chamnanlor, Chettha [1 ]
Sethanan, Kanchana [1 ]
Chien, Chen-Fu [2 ]
Gen, Mitsuo [2 ,3 ]
机构
[1] Khon Kaen Univ, Dept Ind Engn, Fac Engn, Khon Kaen, Thailand
[2] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu, Taiwan
[3] Fuzzy Log Syst Inst, Iizuka, Fukuoka, Japan
关键词
re-entrant flow shop; time window; hybrid genetic algorithm; local search; auto-tuning strategy; fuzzy logic control; FLEXIBLE JOB-SHOP; MINIMIZING MAKESPAN; NETWORK DESIGN;
D O I
10.1080/00207543.2013.861949
中图分类号
T [工业技术];
学科分类号
120111 [工业工程];
摘要
The re-entrant flow shop scheduling problem considering time windows constraint is one of the most important problems in hard-disc drive (HDD) manufacturing systems. In order to maximise the system throughput, the problem of minimising the makespan with zero loss is considered. In this paper, evolutionary techniques are proposed to solve the complex re-entrant scheduling problem with time windows constraint in manufacturing HDD devices with lot size. This problem can be formulated as a deterministic Fm|fmls, rcrc, temp|C-max problem. A hybrid genetic algorithm was used for constructing chromosomes by checking and repairing time window constraints, and improving chromosomes by a left-shift heuristic as a local search algorithm. An adaptive hybrid genetic algorithm was eventually developed to solve this problem by using fuzzy logic control in order to enhance the search ability of the genetic algorithm. Finally, numerical experiments were carried out to demonstrate the efficiency of the developed approaches.
引用
收藏
页码:2612 / 2629
页数:18
相关论文
共 32 条
[1]
Abe K., 2008, INTELLIGENT ENG SYST, V18, P381
[2]
Hybrid tabu search for re-entrant permutation flow-shop scheduling problem [J].
Chen, Jen-Shiang ;
Pan, Jason Chao-Hsien ;
Wu, Chien-Kuang .
EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (03) :1924-1930
[3]
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem [J].
Chen, Jen-Shiang ;
Pan, Jason Chao-Hsien ;
Lin, Chien-Min .
EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (01) :570-577
[4]
Minimizing makespan in reentrant flow-shops using hybrid tabu search [J].
Chen, Jen-Shiang ;
Pan, Jason Chao-Hsien ;
Wu, Chien-Kuang .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 34 (3-4) :353-361
[5]
Chien CF, 2007, OR SPECTRUM, V29, P391, DOI [10.1007/S00291-006-0062-3, 10.1007/s00291-006-0062-3]
[6]
Minimizing makespan on an m-machine re-entrant flowshop [J].
Choi, Seong-Woo ;
Kim, Yeong-Dae .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) :1684-1696
[7]
Minimizing total tardiness on a two-machine re-entrant flowshop [J].
Choi, Seong-Woo ;
Kim, Yeong-Dae .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (02) :375-384
[8]
Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm [J].
Gao, Jie ;
Gen, Mitsuo ;
Sun, Linyan .
JOURNAL OF INTELLIGENT MANUFACTURING, 2006, 17 (04) :493-507
[9]
Gen M., 1999, GENETIC ALGORITHMS E, V7
[10]
Gen M, 2009, STUD COMPUT INTELL, V187, P105