Improved bounds for acyclic job shop scheduling

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 624-633

  Feige, Uriel ^a   Scheideler, Christian ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SCHEDULING;

ACYCLIC JOB SHOP SCHEDULING PROBLEMS;

OPTIMIZATION;

EID: 0031634766     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)