A two-level genetic algorithm for scheduling in assembly islands with fixed-position layouts

This paper focuses on the scheduling problem in assembly islands environment with fixed-position layouts. In such configuration, the product normally remains in one location for its entire manufacturing period while machines, materials and workers are moved to an assembly site called an assembly island. This production layout has some unique features such as moving assembly workers, tools and materials; limited space at assembly site; considerable distance between islands. The authors first give the definition and mathematical model for the scheduling problem and then propose a two-level genetic algorithm to obtain a near optimal solution to minimize the makespan. Experimental results show that this algorithm is effective. The performance analysis of the proposed algorithm indicates that it is more efficient in the airline or shipbuilding industry than in the machine or tool final assembly companies.

[1]  Pingyu Jiang,et al.  RFID-based wireless manufacturing for walking-worker assembly islands with fixed-position layouts , 2007 .

[2]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[3]  P. Luh,et al.  Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[4]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[5]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

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

[7]  Chelliah Sriskandarajah,et al.  The two‐machine permutation flow shop with state‐dependent processing times , 1992 .

[8]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[9]  Antony R Mileham,et al.  Comparison between fixed- and walking-worker assembly lines , 2005 .

[10]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[11]  秦威,et al.  RFID-enabled real-time scheduling for assembly islands with fixed-position layouts , 2008 .

[12]  Ole Madsen,et al.  Cybernetic Modelling and Control in Integrated Production Systems - A project Overview , 1993 .

[13]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 2000, Springer Berlin Heidelberg.

[14]  Nhu Binh Ho,et al.  An effective architecture for learning and evolving flexible job-shop schedules , 2007, Eur. J. Oper. Res..

[15]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[16]  Rene Driessel,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search , 2009, 2009 International Conference on Computers & Industrial Engineering.

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

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

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

[20]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[21]  H. P. Schwefel,et al.  Numerische Optimierung von Computermodellen mittels der Evo-lutionsstrategie , 1977 .