Priority algorithms for makespan minimization in the subset model

Information Processing Letters

Volumn 84, Issue 3, 2002, Pages 153-157

  Regev, Oded ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Approximation algorithms; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; OPTIMIZATION; SCHEDULING;

SUBSET MODELS;

SET THEORY;

EID: 0037110728     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00264-8     Document Type: Article

References (8)

1. The competitiveness of on-line assignments
2. (Incremental) Priority Algorithms
3. Balanced allocations for tree-like inputs
4. Approximation algorithms for scheduling unrelated parallel machines
5. An approximation algorithm for the generalized assignment problem