Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process

Abstract We consider a scheduling problem in a factory producing printed circuit boards (PCBs). The PCB assembly process in this factory can be regarded as a flowshop which has two special characteristics: jobs have sequence dependent setup times and each job consists of a lot (batch) of identical PCBs. Because of the latter characteristic, it is possible to start a job on a following machine before the job is entirely completed on a previous machine, that is, there is time-lag between machines. In this paper, we propose several heuristics, including taboo search (TS) and simulated annealing (SA) methods, for this generalized flowshop scheduling problem with the objective of minimizing mean tardiness. We compare suggested heuristics after series of tests to find appropriate values for parameters needed for the two search algorithms, TS and SA. Results of computational tests on randomly generated test problems are reported.

[1]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[2]  Chris N. Potts,et al.  A comparison of local search methods for flow shop scheduling , 1996, Ann. Oper. Res..

[3]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[4]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[5]  Billy E. Gillett,et al.  A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks , 1991, INFORMS J. Comput..

[6]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

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

[9]  Fred W. Glover,et al.  Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..

[10]  Imre Bárány,et al.  A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees , 1981, Math. Oper. Res..

[11]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[12]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

[13]  Wen-Chyuan Chiang,et al.  A simulated annealing procedure for single row layout problems in flexible manufacturing systems , 1992 .

[14]  J. Gupta.  FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES , 1986 .

[15]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

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

[17]  Fred Glover,et al.  Integrating target analysis and tabu search for improved scheduling systems , 1993 .

[18]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

[19]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

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

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

[22]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[23]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[24]  Julio Michael Stern.  Simulated Annealing with a Temperature Dependent Penalty Function , 1992, INFORMS J. Comput..

[25]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

[26]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[27]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[28]  R. Battiti,et al.  Simulated annealing and Tabu search in the long run: A comparison on QAP tasks☆ , 1994 .

[29]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[30]  William P. Darrow,et al.  The two-machine sequence dependent flowshop scheduling problem , 1986 .

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

[32]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[33]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

[34]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[35]  Jv Simons.  Heuristics in flow shop scheduling with sequence dependent setup times , 1992 .

[36]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[37]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[38]  Jadranka Skorin-Kapov,et al.  Scheduling a flow-line manufacturing cell: a tabu search approach , 1993 .

[39]  R. G. Vickson,et al.  Two- and three-machine flow shop scheduling problems with equal sized transfer batches , 1992 .

[40]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

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

[42]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[43]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[44]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[45]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

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

[47]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

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

[49]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[50]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..