Beam search heuristics for quadratic earliness and tardiness scheduling

Beam search heuristics for quadratic earliness and tardiness scheduling

0.00 Avg rating0 Votes
Article ID: iaor20102633
Volume: 61
Issue: 4
Start Page Number: 620
End Page Number: 631
Publication Date: Apr 2010
Journal: Journal of the Operational Research Society
Authors:
Keywords: beam search
Abstract:

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of different rules on the performance of the beam search procedures. The computational results show that using better dispatching heuristics improves the effectiveness of the beam search algorithms. The performance of the several heuristics is similar for instances with low variability. For high variability instances, however, the detailed, filtered and recovering beam search (RBS) procedures clearly outperform the best existing heuristic. The detailed beam search algorithm performs quite well, and is recommended for small- to medium-sized instances. For larger instances, however, this procedure requires excessive computation times, and the RBS algorithm then becomes the heuristic of choice.

Reviews

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