Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Authors:
- Silvano MartelloSMSilvano Martello
- François SoumisFSFrançois Soumis
- Paolo TothPTPaolo Toth
- 1 May 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 75 (2) , 169-188
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The bottleneck generalized assignment problemEuropean Journal of Operational Research, 1995
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- 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
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical ProcessorsJournal of the ACM, 1977
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Lagrangean relaxation for integer programming1974