Job shop scheduling with beam search

Job shop scheduling with beam search

0.00 Avg rating0 Votes
Article ID: iaor20003429
Country: Netherlands
Volume: 118
Issue: 2
Start Page Number: 390
End Page Number: 412
Publication Date: Oct 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics, programming: branch and bound
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.