Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
- 1 February 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (1) , 151-173
- https://doi.org/10.1137/0210012
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Worst Case Analysis of Two Scheduling AlgorithmsSIAM Journal on Computing, 1977
- Bounds for LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- On a class of scheduling algorithms for multiprocessors computing systemsPublished by Springer Nature ,1975
- An Almost-Optimal Algorithm for the Assembly Line Scheduling ProblemIEEE Transactions on Computers, 1974
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961