The exact LPT-bound for maximizing the minimum completion time

Operations Research Letters

Volumn 11, Issue 5, 1992, Pages 281-287

  Csirik, János ^a   Kellerer, Hans ^b   Woeginger, Gerhard ^c  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITY OF GRAZ   (Austria)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

combinatorial problems; scheduling; suboptimal algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; JOB ANALYSIS; OPTIMIZATION;

COMBINATORIAL PROBLEMS; MINIMUM COMPLETION TIME; SUBOPTIMAL ALGORITHMS;

SCHEDULING;

EID: 0026881284     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(92)90004-M     Document Type: Article

References (3)

1. A performance guarantee for the greedy set-partitioning algorithm
2. Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
3. Analysis of greedy solutions for a replacement part sequencing problem