A state-of-the-art review of parallel-machine scheduling research
- 15 August 1990
- journal article
- review article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 47 (3), 271-292
- https://doi.org/10.1016/0377-2217(90)90215-w
Abstract
No abstract availableThis publication has 76 references indexed in Scilit:
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel MachinesJournal of the Operational Research Society, 1989
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtimeInternational Journal of Production Research, 1988
- Hu's precedence tree scheduling algorithm: A simple proofNaval Research Logistics Quarterly, 1984
- Bounds on Schedules for Independent Tasks with Similar Execution TimesJournal of the ACM, 1981
- A linear time approximation algorithm for multiprocessor schedulingBIT Numerical Mathematics, 1979
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer SystemsJournal of the ACM, 1975
- Scheduling with parallel processors and linear delay costsNaval Research Logistics Quarterly, 1973