A comment on scheduling two parallel machines with capacity constraints

Discrete Optimization

Volumn 2, Issue 3, 2005, Pages 269-272

  Woeginger, Gerhard J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation algorithm; Approximation scheme; Parallel machine scheduling

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

SCHEDULING INDEPENDENT JOBS; SEMIDEFINITE PROGRAMMING;

SCHEDULING;

EID: 27144492672     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.06.005     Document Type: Article

References (4)

1. A.A. Ageev, and M.I. Sviridenko Pipage rounding: A new method of constructing algorithms with proven performance guarantee J. Combin. Optim. 8 2004 307 328
2. J. Bramel, L. Chan, D. Simchi-Levi, Worst-case analysis of the modified LPT heuristic for the two-machine makespan problem with capacity constraints, Manuscript.
3. G.J. Woeginger When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS) ? INFORMS J. Comput. 12 2000 57 75
4. H. Yang, Y. Ye, and J. Zhang An approximation algorithm for scheduling two parallel machines with capacity constraints Discrete Appl. Math. 130 2003 449 467