Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach

European Journal of Operational Research

Volumn 165, Issue 2, 2005, Pages 457-467

  Ghirardi, M ^a   Potts, C N ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Beam search; Scheduling; Unrelated machines

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION MAKING; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

BEAM SEARCH; INTER PROCESSING; PARALLEL MACHINES; UNREALTED MACHINES;

SCHEDULING;

EID: 13444278719     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.04.015     Document Type: Article

References (16)

1. Davis E., Jaffe J.M. Algorithms for scheduling tasks on unrelated processors. Journal of the Association for Computing Machinery. 28:1981;721-736
2. De P., Morton T.E. Scheduling to minimise makespan on unequal parallel processors. Decision Sciences. 11:1980;586-603
3. Della Croce F., Ghirardi M., Tadei R. Recovering Beam Search: Enhancing the beam search approach for combinatorial optimisation problems. Journal of Heuristics. 10:2004;89-104
4. Della Croce F., T'kindt V. A Recovering Beam Search procedure for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society. 53:2002;1275-1280
5. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco
6. Graham R.L., Lawler E.L., Lenstra J.K, Rinnooy Kan A.H.G Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics. 5:1979;287-326
7. Hariri A.M.A., Potts C.N. Heuristics for scheduling unrelated parallel machines. Computers and Operations Research. 18:1991;313-321
8. Horowitz E., Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery. 25:1976;612-619
9. Ibarra O.H., Kim C.E. Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the Association for Computing Machinery. 24:1977;280-289
10. Lenstra J.K., Shmoys D.B., Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming. 46:1990;259-271
11. Martello S., Soumis F., Toth P. Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Applied Mathematics. 75:1997;169-188
12. Ow P.S., Morton T.E. Filtered beam search in scheduling. International Journal of Production Research. 29:1988;1521-1533
13. U.S. Palekar, N. Rama, K. Toaffe, Duality based relaxations for makespan minimization for unrelated parallel machines, TIMS/ORSA, Nashville, 1991
14. Potts C.N. Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics. 10:1985;155-164
15. Srivastava B. An effective heuristic for minimising makespan on unrelated parallel machines. Journal of the Operational Research Society. 49:1998;886-894
16. Van de Velde S.L. Duality based algorithm for scheduling unrelated parallel machines. ORSA Journal on Computing. 5:1993;192-205