An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times

Much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. This paper deals with the hybrid flow shop scheduling problems in which there are sequence dependent setup times, commonly known as the SDST hybrid flow shops. This type of production system is found in industries such as chemical, textile, metallurgical, printed circuit board, and automobile manufacture. With the increase in manufacturing complexity, conventional scheduling techniques for generating a reasonable manufacturing schedule have become ineffective. An immune algorithm (IA) can be used to tackle complex problems and produce a reasonable manufacturing schedule within an acceptable time. This paper describes an immune algorithm approach to the scheduling of a SDST hybrid flow shop. An overview of the hybrid flow shops and the basic notions of an IA are first presented. Subsequently, the details of an IA approach are described and implemented. The results obtained are compared with those computed by Random Key Genetic Algorithm (RKGA) presented previously. From the results, it was established that IA outperformed RKGA.

[1]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[2]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[3]  Ching-Jong Liao,et al.  A case study in a two-stage hybrid flow shop with setup time and dedicated machines , 2003 .

[4]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

[5]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

[6]  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.

[7]  Antony Vignier,et al.  A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.

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

[9]  E. Stafford,et al.  On the Srikar-Ghosh MILP model for the iVx M SDST flowshop problem , 1990 .

[10]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[11]  John L. Hunsucker,et al.  An evaluation of sequencing heuristics in flow shops with multiple processors , 1996 .

[12]  C. Proust,et al.  New lower bound for the hybrid flowshop scheduling problem , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.

[13]  Dileep R. Sule,et al.  Sequencing n jobs on two machines with setup, processing and removal times separated , 1982 .

[14]  Uwe Aickelin,et al.  Special issue on artificial immune systems , 2008, Evol. Intell..

[15]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[16]  Chandrasekharan Rajendran,et al.  Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .

[17]  D. E. Deal,et al.  FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors , 1995 .

[18]  James Brian Quinn,et al.  Technology in services , 1987 .

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

[20]  Jonathan F. Bard,et al.  Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups , 1998, Comput. Oper. Res..

[21]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

[22]  Shyh-Jier Huang,et al.  An immune-based optimization method to capacitor placement in a radial distribution system , 2000 .

[23]  Salah E. Elmaghraby,et al.  Symposium on the Theory of Scheduling and Its Applications , 1973 .

[24]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[25]  Zonghai Chen,et al.  Resolution of multicomponent overlapping chromatogram using an immune algorithm and genetic algorithm , 2000 .

[26]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[27]  J. Chun,et al.  Shape optimization of electromagnetic devices using immune algorithm , 1997 .

[28]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

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

[31]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

[32]  Tadeusz Sawik,et al.  A scheduling algorithm for flexible flow lines with limited intermediate buffers , 1993 .

[33]  MARY E. KURZ,et al.  An adaptable problem-space-based search method for flexible flow line scheduling , 2001 .

[34]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[35]  L.N. de Castro,et al.  An artificial immune network for multimodal function optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[36]  Steven A. Frank,et al.  The Design of Natural and Artificial Adaptive Systems , 1996 .

[37]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[38]  G L Ada,et al.  The clonal-selection theory. , 1987, Scientific American.

[39]  Seetharama L. Narasimhan,et al.  A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[40]  Bo Chen.  Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .

[41]  J G Daugman,et al.  Information Theory and Coding , 1998 .

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

[43]  Dipankar Dasgupta,et al.  Guest editorial special issue on artificial immune systems , 2002, IEEE Trans. Evol. Comput..

[44]  Soumen Ghosh,et al.  A MILP model for the n-job, M-stage flowshop with sequence dependent set-up times , 1986 .

[45]  Fong-Yuen Ding,et al.  Heuristics for scheduling flexible flow lines , 1994 .

[46]  Sergei A. Gutnikov,et al.  A simple non-linear model of immune response , 2003 .

[47]  Ronald G. Askin,et al.  An Adaptable Problem-space-based Search Method for Flexible Flow Line Scheduling , 2001 .

[48]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[49]  J. Gupta,et al.  A flow‐shop problem with sequence‐dependent additive setup times , 1987 .

[50]  D. Dasgupta,et al.  Immunity-based systems: a survey , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[51]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[52]  Ronald G. Askin,et al.  Heuristic scheduling of parallel machines with sequence-dependent set-up times , 2001 .

[53]  Kazuyuki Mori,et al.  Immune Algorithm with Searching Diversity and its Application to Resource Allocation Problem , 1993 .

[54]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[55]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[56]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

[57]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[58]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[59]  Licheng Jiao,et al.  A novel genetic algorithm based on immunity , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[60]  Huang Dao,et al.  Optimization production scheduling of multi-stage interrelated discrete system via synthetic knowledge , 1994, Proceedings of 1994 American Control Conference - ACC '94.

[61]  Tadeusz Sawik,et al.  Scheduling flexible flow lines with no in-process buffers , 1995 .

[62]  Bertrand M. T. Lin,et al.  Two-stage flowshop scheduling with a common second-stage machine , 1997, Comput. Oper. Res..

[63]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

[64]  Michael Pinedo,et al.  BPSS: A Scheduling Support System for the Packaging Industry , 1993, Oper. Res..

[65]  Eugeniusz Nowicki,et al.  An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times , 1994, Discret. Appl. Math..

[66]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[67]  Raúl Hector Gallard,et al.  Genetic algorithms + Data structure = Evolution programs , Zbigniew Michalewicz , 1999 .

[68]  Shyh-Jier Huang,et al.  Application of Immune-Based Optimization Method for Fault-Section Estimation in a Distribution System , 2002, IEEE Power Engineering Review.

[69]  Jatinder N. D. Gupta,et al.  A flowshop scheduling problem with two operations per job , 1997 .

[70]  J. C. Bean,et al.  A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMS , 1999 .

[71]  Michael J. Shaw,et al.  A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes , 1997, IEEE Trans. Syst. Man Cybern. Part B.