Parallel Genetic Algorithm for a Flow-Shop Problem with Multiprocessor Tasks

Machine scheduling problems belong to the most difficult deterministic combinatorial optimization problems. Since most scheduling problems are NPhard, it is impossible to find the optimal schedule in reasonable time. In this paper, we consider a flow-shop scheduling problem with multiprocessor tasks. A parallel genetic algorithm using multithreaded programming technique is developed to obtain a quick but good solution to the problem. The performance of the parallel genetic algorithm under various conditions and parameters are studied and presented.

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

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

[3]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[4]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[5]  Marco Ferretti,et al.  Pyramidal Architectures for Computer Vision , 1994, Advances in Computer Vision and Machine Intelligence.

[6]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[7]  A. Bose,et al.  A highly parallel method for transient stability analysis , 1989, Conference Papers Power Industry Computer Application Conference.

[8]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[9]  Errol L. Lloyd,et al.  Concurrent Task Systems , 1981, Oper. Res..

[10]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[11]  Yu-Fai Fung,et al.  The design and evaluation of a multiprocessor system for computer vision , 2000, Microprocess. Microsystems.

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

[13]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[14]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..