An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan

No-wait flowshop scheduling problem (NW-FSSP) with the objective to minimize the makespan is an important sequencing problem in the production plans and applications of no-wait flowshops can be found in several industries. In a NW-FSSP, jobs are not allowed to wait between two successive machines. The NW-FSSPs are addressed to minimize makespan and the NW-FSSP is known as a NP- Hard problem. In this study, Agarwal et al.'s1 adaptive learning approach (ALA) is improvement for NW-FSSPs. Improvements in adaptive learning approach is similar to neural-network training. The improvement adaptive learning approach (IALA) is applied to all of the 192 problems. The proposed IALA method for NW-FSSP is compared with Aldowaisan and Allahverdi's2 results by using Genetic heuristic. The results of computational experiments on randomly generated NW-FSSPs are show that the proposed adaptive learning approach performs quite well.

[1]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[2]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[3]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[4]  Cengiz Kahraman,et al.  An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems , 2008, Int. J. Comput. Intell. Syst..

[5]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[6]  Derya Eren Akyol,et al.  A review on evolution of production scheduling with neural networks , 2007, Comput. Ind. Eng..

[7]  Ravi Shankar,et al.  A neuro-tabu search heuristic for the flow shop scheduling problem , 2004, Comput. Oper. Res..

[8]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[9]  T. C. Edwin Cheng,et al.  A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups , 2006, Comput. Oper. Res..

[10]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[11]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[12]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[13]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[14]  Derya Eren Akyol,et al.  Application of neural networks to heuristic scheduling algorithms , 2004, Comput. Ind. Eng..

[15]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[16]  Michael J. Shaw,et al.  A neural-net approach to real time flow-shop sequencing , 2000 .

[17]  Varghese S. Jacob,et al.  Heuristics and augmented neural networks for task scheduling with non-identical machines , 2006, Eur. J. Oper. Res..

[18]  Dexian Huang,et al.  Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution , 2009, Soft Comput..

[19]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[20]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[21]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[22]  S. Shyu,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

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

[24]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[25]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[26]  Daniel J. Fonseca,et al.  Artificial neural networks for job shop simulation , 2002, Adv. Eng. Informatics.

[27]  Dunwei Gong,et al.  A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem , 2007 .

[28]  R. Tavakkoli-Moghaddam,et al.  Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm , 2008 .

[29]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[30]  Young Hoon Lee,et al.  Scheduling jobs on parallel machines applying neural network and heuristic rules , 2000 .

[31]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[32]  R. Tavakkoli-Moghaddam,et al.  A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem , 2008 .

[33]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[34]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[35]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[36]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[37]  Anurag Agarwal,et al.  Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..

[38]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .