Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study

The flow shop with multiple processors (FSMP) environment is relatively common and has a variety of applications. The majority of academic authors solve the scheduling problem of FSMP using deterministic data that ignore the stochastic nature of a real-world problem. Discrete-event simulation can model a non-linear and stochastic problem and allows examination of the likely behaviour of a proposed manufacturing system under selected conditions. However, it does not provide a method for optimization. The present paper proposes to solve the FSMP scheduling problem by using a tabu-search simulation optimization approach. It features both the stochastically modelling capability of the discrete-event simulation and the efficient local-search algorithm of tabu search. A case study from a multilayer ceramic capacitor manufacturing illustrates the proposed solution methodology. Empirical results show promise for the practical application of the proposed methodologies. Future research opportunities are then addressed.

[1]  Ki-Young Jeong,et al.  Conceptual frame for development of optimized simulation-based scheduling systems , 2000 .

[2]  Jürgen Dorn,et al.  Comparison of iterative improvement techniques for schedule optimization , 1996 .

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

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

[5]  Andrew J. Higgins,et al.  A dynamic tabu search for large-scale generalised assignment problems , 2001, Comput. Oper. Res..

[6]  Chun-Hung Chen,et al.  Scheduling semiconductor wafer fabrication by using ordinal optimization-based simulation , 2001, IEEE Trans. Robotics Autom..

[7]  Taho Yang,et al.  Solving a multi-objective simulation model using a hybrid response surface method and lexicographical goal programming approach—a case study on integrated circuit ink-marking machines , 2002, J. Oper. Res. Soc..

[8]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[9]  U. Wen,et al.  A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem , 1996 .

[10]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[11]  M. Laguna,et al.  SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH , 1993 .

[12]  Taho Yang,et al.  Semiconductor fabrication facility design using a hybrid search methodology , 1999 .

[13]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[14]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[15]  D. E. Deal,et al.  Job scheduling in petrochemical production : two-stage processing with finite intermediate storage , 1994 .

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

[17]  Yoichi Miyake,et al.  Production scheduling system in the hybrid flow shop , 1993 .

[18]  Nikolay Tchernev,et al.  Generic simulation model for hybrid flow-shop , 1999 .

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

[20]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[21]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[22]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

[23]  Ebbe G. Negenman,et al.  Local search algorithms for the multiprocessor flow shop scheduling problem , 2001, Eur. J. Oper. Res..

[24]  Jatinder N. D. Gupta,et al.  Flowshop scheduling with set-up, processing and removal times separated , 1991 .

[25]  Serge Domenech,et al.  A two-stage methodology for short-term batch plant scheduling , 1998 .

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

[27]  Ramón Alvarez-Valdés,et al.  Design and implementation of a course scheduling system using Tabu Search , 2002, Eur. J. Oper. Res..

[28]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

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