Parallel flowshop scheduling using Tabu search

Production scheduling problems in manufacturing systems with parallel machine flowshops are discussed. A mathematical programming model for combined part assignment and job scheduling is developed. The objective of solving the scheduling problem is to minimize a weighted sum of production cost and the cost incurred from late product delivery. The solution of the model is NP-hard. To solve the problem efficiently, a heuristic algorithm combining Tabu search and Johnson's method was proposed. Several numerical examples are presented to illustrate the developed model and the algorithm. Computational results from these example problems are very encouraging.

[1]  M. Pirlot.  General local search methods , 1996 .

[2]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[3]  Nanua Singh.  Systems Approach to Computer-Integrated Design and Manufacturing , 1995 .

[4]  Jose A. Ventura,et al.  Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .

[5]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[6]  John W. Fowler,et al.  A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..

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

[8]  Kunihiko Hiraishi,et al.  Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs , 2000, Comput. Oper. Res..

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

[10]  Lap Mui Ann Chan,et al.  Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics , 1998, Oper. Res..

[11]  Meral Azizoglu,et al.  Scheduling jobs on unrelated parallel machines to minimize regular total cost functions , 1999 .

[12]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..

[13]  S. Sarin,et al.  An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime , 1988 .

[14]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[15]  Saïd Salhi,et al.  Defining tabu list size and aspiration criterion within tabu search methods , 2002, Comput. Oper. Res..

[16]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[17]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[18]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

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