Iterated greedy local search methods for unrelated parallel machine scheduling

European Journal of Operational Research

Volumn 207, Issue 1, 2010, Pages 55-69

  Fanjul Peyro, Luis ^a   Ruiz, Rubén ^a  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

Iterated greedy; Local search; Makespan; Unrelated parallel machines

Indexed keywords

COMBINATORIAL PROBLEM; COMPLETION TIME; LOCAL SEARCH; LOCAL SEARCH METHOD; MAKESPAN; META HEURISTICS; PARALLEL MACHINE; PARALLEL MACHINE-SCHEDULING PROBLEMS; PROCESSING TIME; UNRELATED PARALLEL MACHINES;

COMBINATORIAL MATHEMATICS; MACHINERY;

SCHEDULING ALGORITHMS;

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

References (39)

1. Cheng T.C.E., and Sin C.C.S. A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 47 3 (1990) 271-292
2. Davis E., and Jaffe J.M. Algorithms for scheduling tasks on unrelated processors. Journal of the ACM 28 4 (1981) 721-736
3. De P., and Morton T.E. Scheduling to minimise makespan on unequal parallel processors. Management Science 11 4 (1980) 586-602
4. de la Croce F., Ghirardi M., and Tadei R. Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics 10 1 (2004) 89-104
5. Dillenberger C., Escudero L.F., Wollensak A., and Wu Z. On practical resource-allocation for production planning and scheduling with period overlapping setups. European Journal of Operational Research 75 2 (1994) 275-286
6. Gairing M., Monien B., and Woclaw A. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical Computer Science 380 1-2 (2007) 87-99
7. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
8. Ghirardi M., and Potts C.N. Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research 165 2 (2005) 457-467
9. Glass C.A., Potts C.N., and Shade P. Unrelated parallel machine scheduling using local search. Mathematical and Computer Modelling 20 2 (1994) 41-52
10. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17 2 (1969) 416-429
11. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
12. Hansen P., and Mladenovic N. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 3 (2001) 449-467
13. Hariri A.M.A., and Potts C.N. Heuristics for scheduling unrelated parallel machines. Computers & Operations Research 18 3 (1991) 323-331
14. Horowitz E., and Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM 23 2 (1976) 317-327
15. Ibarra O.H., and Kim C.E. Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the ACM 24 2 (1977) 280-289
16. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
17. Lenstra J.K., Shmoys D.B., and Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46 3 (1990) 259-271
18. Mansini R., and Speranza M.G. Heuristic algorithms for the portfolio selection problem with minimum transaction lots. European Journal of Operational Research 114 2 (1999) 219-233
19. Martello S., Soumis F., and Toth P. Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Applied Mathematics 75 2 (1997) 169-188
20. McNaughton R. Scheduling with deadlines and loss functions. Management Science 6 1 (1959) 1-12
21. Mladenovic N., and Hansen P. Variable neighborhood search. Computers & Operations Research 24 11 (1997) 1097-1100
22. Mokotoff E. Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research 18 2 (2001) 193-242
23. Mokotoff E., and Chretienne P. A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research 141 3 (2002) 515-525
24. Mokotoff E., and Jimeno J.L. Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals of Operations Research 117 1-4 (2002) 133-150
25. Montgomery D.C. Design and Analysis of Experiments. seventh ed. (2009), Wiley, New York
26. Ow P.S., and Morton T.E. Filtered beam search in scheduling. International Journal of Production Research 26 1 (1988) 35-62
27. Piersma N., and van Dijk W. A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Mathematical and Computer Modelling 24 9 (1996) 11-19
28. Pinedo M.L. Planning and Scheduling in Manufacturing and Services. Series in Operations Research (2005), Springer, New York, USA
29. Pinedo M.L. Scheduling: Theory, Algorithms, and Systems. third ed. (2008), Springer, New York, USA
30. Potts C.N. Analysis of a linear-programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics 10 2 (1985) 155-164
31. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 3 (2007) 2033-2049
32. Ruiz R., and Stützle T. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187 3 (2008) 1143-1159
33. Shchepin E.V., and Vakhania N. An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters 33 2 (2005) 127-133
34. Shmoys D.B., and Tardos E. An approximation algorithm for the generalized assignment problem. Mathematical Programming 62 3 (1993) 461-474
35. Sourd F. Scheduling tasks on unrelated machines: Large neighborhood improvement procedures. Journal of Heuristics 7 6 (2001) 519-531
36. Srivastava B. An effective heuristic for minimising makespan on unrelated parallel machines. Journal of the Operational Research Society 49 8 (1998) 886-894
37. Sule D.R. Production Planning and Industrial Scheduling: Examples, Case Studies and Applications. second ed. (2008), CRC Press, Boca Raton, USA
38. van de Velde S.L. Duality based algorithms for scheduling unrelated parallel machines. ORSA Journal on Computing 5 5 (1993) 192-205
39. Woclaw, A., 2006. Scheduling Unrelated Parallel Machines. Algorithms, Complexity, and Performance. Ph.D. Thesis, Fakultat fur Elektrotechnik, Informatik und Mathematik der Universitat Paderborn, Deutschland.