Job shop scheduling with beam search

Creative Commons License

Sabuncuoglu İ., Bayiz M.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol.118, no.2, pp.390-412, 1999 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 118 Issue: 2
  • Publication Date: 1999
  • Doi Number: 10.1016/s0377-2217(98)00319-1
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.390-412
  • Abdullah Gül University Affiliated: No


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. (C) 1999 Elsevier Science B.V. All rights reserved.