This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize the makespan. Recovering Beam Search is a recently introduced method for obtaining approximate solutions to combinatorial optimization problems. A traditional Beam Search algorithm is a type of truncated branch and bound algorithm approach. However, Recovering Beam Search allows the possibility of correcting wrong decisions by replacing partial solutions with others. We develop a Recovering Beam Search algorithm for our unrelated parallel machine scheduling problem that requires polynomial time. Computational results show that it is able to generate approximate solutions for instances with large size (up to 1000 jobs) using a few minutes of computation time.
|Titolo:||Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach|
|Data di pubblicazione:||2005|
|Digital Object Identifier (DOI):||10.1016/j.ejor.2004.04.015|
|Appare nelle tipologie:||1.1 Articolo in rivista|