Heuristics for unrelated machine scheduling with precedence constraints

European Journal of Operational Research

Volumn 102, Issue 3, 1997, Pages 528-537

  Herrmann, Jeffrey ^a   Proth, Jean Marie ^a,b   Sauer, Nathalie ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b INRIA   (France)

Author keywords

Makespan; Parallel resources; Scheduling

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SCHEDULING;

PARALLEL RESOURCES;

PRODUCTION CONTROL;

EID: 0031275738     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00247-0     Document Type: Article

References (14)

1. Cheng, T.C.E., and Sin, C.C.S. (1990), "A state-of-the-art review of parallel machine scheduling research", European Journal of Operational Research 47, 271-292.
2. Darema, F., Kirkpatrick, S., and Norton, V.A. (1987), "Parallel algorithms for chip placement by simulated annealing", IBM Journal of Research and Development, 31(3), 391-402.
3. Davis, E., and Jaffe, J.M. (1981), "Algorithm for scheduling tasks on unrelated processors", Journal of the Association for Computing Machinery, 28(4), 721-736.
4. Du, J., Leung, J.Y.-T., and Young, G.H. (1991), "Scheduling chain structured tasks to minimize makespan and mean flow time", Information and Computation 92, 219-236.
5. Graham, R.L. (1966), "Bound on certain multiprocessing anomalies", Bell System Technical Journal 45, 1563-1581.
6. Hariri, A.M.A., and Potts, C.N. (1991), "Heuristics for scheduling unrelated parallel machines", Computers and Operations Research 18(3), 323-331.
7. Hoitmont, D.J., Luh, P.B., Max, E., and Pattipati, K.R. (1990), "Scheduling jobs with simple precedence constraints on parallel machines", IEEE Control Systems Magazine, 10(2), 34-40.
8. Ibarra, O.H., and Kim, C.E. (1977), "Heuristic algorithms for scheduling independent tasks on nonidentical processors", Journal of the Association for Computing Machinery, 24(2), 280-289.
9. Johnson, D.S., Aragon, C.R., McGeoch, L.A., and Schevon, C. (1989), "Optimization by simulated annealing: An experimental evaluation; Part 1: Graph partitioning", Operations Research, 37(6), 865-892.
10. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P. (1983), "Optimization by simulated annealing", Science, 220, 4598.
11. Lenstra, J.K., Shmoys, D.B., and Tardos, E. (1990), "Approximation algorithms for scheduling unrelated parallel machines", Mathematical Programming, 46, 259-271.
12. Potts, C.N., 1985. "Analysis of a linear programming heuristic for scheduling unrelated parallel machines", Discrete Applied Mathematics, 10, 155-164.
13. Ullman, J.D., "NP-complete scheduling problems", Journal of Computing Systems Science, 10, 384-395.
14. Van de Velde, S.L., "Duality based algorithms for scheduling unrelated parallel machines", ORSA Journal on Computing, 5(2), 192-205.