Job shop scheduling with beam search

Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are kept for further branching and remaining nodes are pruned off permanently. In this paper, we develop a beam search based scheduling algorithm for the job shop problem. Both the makespan and mean tardiness are used as the performance measures. The proposed algorithm is also compared with other well known search methods and dispatching rules for a wide variety of problems. The results indicate that the beam search technique is a very competitive and promising tool which deserves further research in the scheduling literature.

[1]  Ihsan Sabuncuoglu,et al.  A neural network model for scheduling problems , 1996 .

[2]  C. B. Besant,et al.  Job-shop scheduling using certain heuristic search algorithms , 1992 .

[3]  Ali S. Kiran,et al.  Simulation studies in job shop sheduling—I a survey , 1984 .

[4]  Ihsan Sabuncuoglu,et al.  A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems , 1998 .

[5]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[6]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

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

[8]  Milton L. Smith,et al.  Simulation studies in job shop scheduling—II: Performance of priority rules , 1984 .

[9]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

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

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

[12]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[13]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

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

[15]  Anita Lee,et al.  Flexible manufacturing system (FMS) scheduling using filtered beam search , 1990, J. Intell. Manuf..

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

[17]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

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

[19]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

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

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