The exact LPT-bound for maximizing the minimum completion time
- 30 June 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 11 (5), 281-287
- https://doi.org/10.1016/0167-6377(92)90004-m
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A performance guarantee for the greedy set-partitioning algorithmActa Informatica, 1984
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor SystemSIAM Journal on Algebraic Discrete Methods, 1982
- Analysis of Greedy Solutions for a Replacement Part Sequencing ProblemMathematics of Operations Research, 1981