Grouping techniques for scheduling problems: Simpler and faster

Algorithmica (New York)

Volumn 51, Issue 2, 2008, Pages 183-199

  Fishkin, Aleksei V ^a   Jansen, Klaus ^b   Mastrolilli, Monaldo ^c  

^a SIEMENS AG   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

^c DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPLICATIVE CONSTANT; PARALLEL MACHINES; SCHEDULING PROBLEMS;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PARALLEL ALGORITHMS; PROBLEM SOLVING;

SCHEDULING;

EID: 42649132161     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9086-6     Document Type: Article

References (24)