Beam search algorithms for the early/tardy scheduling problem with release dates
In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We present several heuristic algorithms based on the beam search technique. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority evaluation functions and problem-specific properties were considered for the filtering step used in the filtered and recovering beam search heuristics. Extensive preliminary tests were performed to determine appropriate values for the parameters used by each algorithm. The computational results show that the recovering beam search algorithms outperform their filtered counterparts in both solution quality and computational requirements, while the priority-based filtering procedure proves superior to the rules-based alternative. The beam search procedure with a total cost evaluation function provides very good results, but is computationally expensive and can therefore only be applied to small or medium size instances. The recovering algorithm is quite close in solution quality and is significantly faster, so it can be used to solve even large instances.
|Date of creation:||Apr 2004|
|Date of revision:|
|Contact details of provider:|| Postal: Rua Dr. Roberto Frias, 4200 PORTO|
Web page: http://www.fep.up.pt/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jorge M. S. Valente & Rui A. F. S. Alves, 2003. "An Exact Approach to Early/Tardy Scheduling with Release Dates," FEP Working Papers 129, Universidade do Porto, Faculdade de Economia do Porto.
- Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
When requesting a correction, please mention this item's handle: RePEc:por:fepwps:143. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.