Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
- 1 September 2005
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 165 (2), 457-467
- https://doi.org/10.1016/j.ejor.2004.04.015
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization ProblemsJournal of Heuristics, 2004
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problemJournal of the Operational Research Society, 2002
- Exact and approximation algorithms for makespan minimization on unrelated parallel machinesDiscrete Applied Mathematics, 1997
- Heuristics for scheduling unrelated parallel machinesComputers & Operations Research, 1991
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Analysis of a linear programming heuristic for scheduling unrelated parallel machinesDiscrete Applied Mathematics, 1985
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- SCHEDULING TO MINIMIZE MAKESPAN ON UNEQUAL PARALLEL PROCESSORSDecision Sciences, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical ProcessorsJournal of the ACM, 1977