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

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 | Cmax 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.

[1]  Mitsuo Gen,et al.  Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm , 2006, J. Intell. Manuf..

[2]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[3]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[4]  Chien-Min Lin,et al.  A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem , 2008, Expert Syst. Appl..

[5]  Mitsuo Gen,et al.  Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation , 2008, Soft Comput..

[6]  Kenichi Ida,et al.  Genetic Local Search Method for Re-Entrant Flow Shop Problem , 2008 .

[7]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

[8]  Chung-Yang Liu,et al.  Scheduling flexible flow shops with sequence-dependent setup effect , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[9]  Danping Lin,et al.  Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem , 2012 .

[10]  Yeong-Dae Kim,et al.  Minimizing total tardiness on a two-machine re-entrant flowshop , 2009, Eur. J. Oper. Res..

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  Mitsuo Gen,et al.  Performance Analysis of Adaptive Genetic Algorithms with Fuzzy Logic and Heuristics , 2003, Fuzzy Optim. Decis. Mak..

[13]  Chi-Hyuck Jun,et al.  Performance analysis of re-entrant flow shop with single-job and batch machines using mean value analysis , 2000 .

[14]  A. T. Johns,et al.  Environmental/economic dispatch using fuzzy logic controlled genetic algorithms , 1997 .

[15]  Mitsuo Gen,et al.  Network modeling and evolutionary optimization for scheduling in manufacturing , 2012, J. Intell. Manuf..

[16]  Jen-Shiang Chen,et al.  Hybrid tabu search for re-entrant permutation flow-shop scheduling problem , 2008, Expert Syst. Appl..

[17]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[18]  Mitsuo Gen,et al.  Evolutionary Network Design by Multiobjective Hybrid Genetic Algorithm , 2009 .

[19]  Lin Danping,et al.  A review of the research methodology for the re-entrant scheduling problem , 2011 .

[20]  Hark Hwang,et al.  Production sequencing problem with reentrant work flows and sequence dependent setup times , 1997 .

[21]  Mitsuo Gen,et al.  Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[22]  Zbigniew Michalewicz,et al.  Adaptation in evolutionary computation: a survey , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[23]  J.-S. Chen,et al.  Minimizing makespan in re-entrant permutation flow-shops , 2003, J. Oper. Res. Soc..

[24]  Mitsuo Gen,et al.  Integrated multistage logistics network design by using hybrid evolutionary algorithm , 2009, Comput. Ind. Eng..

[25]  Jen-Shiang Chen,et al.  Minimizing makespan in reentrant flow-shops using hybrid tabu search , 2007 .

[26]  Guochun Tang,et al.  Minimizing total completion time for re-entrant flow shop scheduling problems , 2011, Theor. Comput. Sci..

[27]  Chen-Fu Chien,et al.  A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups , 2007, OR Spectr..

[28]  Guochun Tang,et al.  Heuristic algorithms for two machine re-entrant flow shop , 2008, Theor. Comput. Sci..

[29]  J. U. Sun,et al.  PRODUCTION SEQUENCING PROBLEM WITH RE-ENTRANT WORK FLOWS AND SEQUENCE DEPENDENT SETUP TIMES , 1998 .

[30]  Hyun Joon Shin,et al.  A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture , 2007 .

[31]  Yeong-Dae Kim,et al.  Minimizing makespan on an m-machine re-entrant flowshop , 2008, Comput. Oper. Res..

[32]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[33]  John W. Fowler,et al.  A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations , 2011, J. Sched..

[34]  Gu Qingming,et al.  A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM , 1998 .