A particle swarm-based genetic algorithm for scheduling in an agile environment

In this paper, genetic algorithms are applied to the scheduling of a manufacturing system that is designed to support an assembly-driven differentiation strategy in the context of agile manufacturing. The system consists of a single flexible machine followed by multiple identical assembly stations. The objective of the scheduling problem is to minimize the makespan. A modified version of the genetic algorithm, inspired by the particle swarm optimization approach, is applied to the problem in addition to the general application of genetic algorithms. The objective is to investigate the potential that the particle swarm optimization concepts may have in improving the performance of genetic algorithms when applied to the chosen problem. The performance of these algorithms is compared to existing heuristics in the literature. A 2^3 factorial experiment, replicated twice, is used to compare the performance of the various approaches and identify the significant factors that affect the average percentage deviation from a lower bound. The results show that both versions of genetic algorithms applications outperform the existing heuristics in many instances and provide schedules that are shorter by as much as 15.5% in the cases considered. In addition, the modified application of genetic algorithms outperforms the regular application with shorter schedules by as much as 3.6% in many instances.

[1]  Pius J. Egbelu,et al.  Scheduling for machining and assembly in a job-shop environment , 1993 .

[2]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[3]  Chilukuri K. Mohan,et al.  Multi-phase Discrete Particle Swarm Optimization , 2002, JCIS.

[4]  Andrew Kusiak,et al.  Performance analysis of modular products , 1996 .

[5]  Tony Owen.  Assembly Automation And Product Design by Geoffrey Boothroyd Marcel Dekker, Inc., New York, 199, 413 pages including index ($114.50 or ca. £65.00) , 1992, Robotica.

[6]  Guoyong Shi,et al.  A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..

[7]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[9]  G. Boothroyd,et al.  Assembly Automation and Product Design , 1991 .

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

[11]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[12]  Chandrasekharan Rajendran,et al.  Scheduling rules for dynamic shops that manufacture multi-level jobs , 2003 .

[13]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[14]  Jose A. Ventura,et al.  An application of genetic algorithms to lot-streaming flow shop scheduling , 2002 .

[15]  Cihan H. Dagli,et al.  A parallel genetic-neuro scheduler for job-shop scheduling problems , 1997 .

[16]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

[17]  GenMitsuo,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II , 1996 .

[18]  Michel Gourgand,et al.  Genetic algorithms applied to workshop problems , 1998, Int. J. Comput. Integr. Manuf..

[19]  J. Kennedy,et al.  Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[20]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[21]  Jatinder N. D. Gupta,et al.  Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .

[22]  Masao Yokoyama,et al.  Hybrid flow-shop scheduling with assembly operations , 2001 .

[23]  Latif Al-Hakim,et al.  An analogue genetic algorithm for solving job shop scheduling problems , 2001 .

[24]  Xi Sun,et al.  Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling , 2003, Eur. J. Oper. Res..

[25]  George L. Vairaktarakis,et al.  Performance Comparison of Some Classes of Flexible Flow Shops and Job Shops , 1998 .

[26]  Andrew Kusiak,et al.  Scheduling manufacturing systems in an agile environment , 2001 .

[27]  Adam Janiak,et al.  Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations , 1998, Ann. Oper. Res..

[28]  L. P. Khoo,et al.  A Tabu-Enhanced Genetic Algorithm Approach to Agile Manufacturing , 2002 .

[29]  Timothy D. Fry,et al.  The effects of product structure and sequencing rule on assembly shop performance , 1989 .

[30]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[31]  L. P. Khoo,et al.  A Prototype Genetic Algorithm-Enhanced Multi-Objective Scheduler for Manufacturing Systems , 2000 .

[32]  Geetha Srinivasan,et al.  A genetic algorithm for job shop scheduling—a case study , 1996 .

[33]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[34]  Robert L. Burdett,et al.  Evolutionary algorithms for flowshop sequencing with non‐unique jobs , 2000 .

[35]  Y. Rahmat-Samii,et al.  Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna , 2002, IEEE Antennas and Propagation Society International Symposium (IEEE Cat. No.02CH37313).

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

[37]  Pupong Pongcharoen,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .

[38]  Andrew Kusiak.  Aggregate scheduling of a flexible machining and assembly system , 1989, IEEE Trans. Robotics Autom..

[39]  Haldun Aytug,et al.  Use of genetic algorithms to solve production and operations management problems: A review , 2003 .

[40]  David He,et al.  Scheduling manufacturing systems for delayed product differentiation in agile manufacturing , 2002 .

[41]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[42]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.