Better approximation guarantees for job-shop scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1997, Pages 599-608

  Goldberg, Leslie Ann ^a   Paterson, Mike ^a   Srinivasan, Aravind ^a   Sweedyk, Elizabeth ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

JOB SHOP SCHEDULING; POLYNOMIAL TIME APPROXIMATION ALGORITHMS;

LINEAR PROGRAMMING;

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

References (17)