Reactive Search for Flexible Job Shop Scheduling

In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available from time zero, and operations are processed without preemption. The objective is to minimize the maximum completion time (makespan). The flexible job shop (FJS) scheduling problem extends JSSP by assuming that, for each given operation, there exists at least one instance of the machine type necessary to perform it. We are thus confronted with two problems, that of assigning each operation to an appropriate machine, and that of sequencing the operations on each machine. The flexible-routing job shop (FRJS) scheduling problem, or job shop with multipurpose machines, extends JSSP by assuming that a machine may be capable of performing more than one type of operation. (For a given operation, there must exist at least one machine capable of performing it.) FRJS approximates a flexible manufacturing environment with numerically controlled work centers equipped with interchangeable tool magazines. This report investigates a reactive search (RS) strategy for FJS and FRJS, and compares it to the authors’ earlier dynamic, adaptive tabu search (TS) method. “Proof-ofconcept” results for problems constructed from three difficult JSSP instances are presented. MS of October 1997 Originally presented as “New Tabu Search Results for the Flexible Job Shop Problem”. INFORMS, Dallas, October 1997 (invited session ). Revised October 1998

[1]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

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

[3]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[4]  Chang Juck Suh.  Controlled search simulated annealing for job scheduling , 1988 .

[5]  J. Wesley Barnes,et al.  New Tabu Search Results for the Job Shop Scheduling Problem , 1996 .

[6]  J. Wesley Barnes,et al.  Tabu Search for the Flexible-Routing Job Shop Problem , 1996 .

[7]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[8]  J. Buzacott,et al.  'Optimal' operating rules for automated manufacturing systems , 1982, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[9]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[10]  M. Widmer,et al.  Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach , 1991 .

[11]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

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

[13]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[14]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[15]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[16]  Elsayed A. Elsayed,et al.  Job shop scheduling with alternative machines , 1990 .

[17]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

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

[19]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[22]  P. Gács,et al.  Algorithms , 1992 .

[23]  David L. Woodruff,et al.  Hashing vectors for tabu search , 1993, Ann. Oper. Res..

[24]  Kazuaki Iwata,et al.  Solution of Large-Scale Scheduling Problems for Job-Shop Type Machining Systems with Alternative Machine Tools , 1980 .

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

[26]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[27]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[28]  Hirofumi Matsuo,et al.  A bottleneck-based beam search for job scheduling in a flexible manufacturing system , 1989 .

[29]  Gerd Finke,et al.  New trends in machine scheduling , 1988 .

[30]  Joseph B. Mazzola,et al.  A tabu-search heuristic for the flexible-resource flow shop scheduling problem , 1993, Ann. Oper. Res..

[31]  Egon Balas,et al.  PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS. , 1968 .