A Recovering Beam Search Algorithm for the One-Machine Dynamic Total Completion Time Scheduling Problem

Federico Della Croce (1) , Vincent t'Kindt (2)

1 DAI
2 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002

This paper deals with the one-machine dynamic total completion time scheduling problem. This problem is known to be NP-hard in the strong sense. A polynomial time heuristic algorithm is proposed which applies the recently introduced Recovering Beam Search (RBS) approach. The algorithm is based on a beam search procedure with unitary beam width and includes a recovering subroutine that allows to overcome wrong decisions taken at higher levels of the beam search tree. It is shown that the total number of considered nodes is bounded by n where n is the jobsize. The proposed algorithm is able to solve in very short CPU time problems with up to 500 jobs outperforming the best state of the art heuristics.

Mots clés: Heuristics; Recovering Beam Search; Total Completion

Domaines: Recherche opérationnelle [math.OC]

Federico Della Croce, Vincent t'Kindt. A Recovering Beam Search Algorithm for the One-Machine Dynamic Total Completion Time Scheduling Problem. Journal of the Operational Research Society, 2002, 53 (11), pp.1275-1280. ⟨hal-00803303⟩