Makespan minimization for unrelated parallel machines: a recovering beam search approach
Makespan minimization for unrelated parallel machines: a recovering beam search approach
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.
scheduling, unrelated machines, beam search
457-467
Ghirardi, M.
7736a3a4-fe9b-4830-8ace-8e032943f84b
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
2005
Ghirardi, M.
7736a3a4-fe9b-4830-8ace-8e032943f84b
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Ghirardi, M. and Potts, C.N.
(2005)
Makespan minimization for unrelated parallel machines: a recovering beam search approach.
European Journal of Operational Research, 165 (2), .
(doi:10.1016/j.ejor.2004.04.015).
Abstract
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.
This record has no associated files available for download.
More information
Published date: 2005
Keywords:
scheduling, unrelated machines, beam search
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29628
URI: http://eprints.soton.ac.uk/id/eprint/29628
ISSN: 0377-2217
PURE UUID: d53e2dcb-c044-4d93-b41b-09b92fd1c582
Catalogue record
Date deposited: 11 May 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
M. Ghirardi
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics