An improved heuristic for minimizing makespan among m identical parallel processors

Computers and Industrial Engineering

Volumn 5, Issue 4, 1981, Pages 279-287

  Blackstone Jr , John H ^a   Phillips, Don T ^b  

^a AUBURN UNIVERSITY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL ENGINEERING - COMPUTER APPLICATIONS;

MAKESPAN;

COMPUTER SYSTEMS, DIGITAL;

EID: 0019696911     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(81)90026-7     Document Type: Article

References (8)

1. Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
2. Bounds for LPT schedules in uniform processors
3. Performance guarantees for scheduling algorithms
4. Bounds for Certain Multiprocessing Anomalies
5. Combinatorial problems: reducibility and approximation