This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
Approximability and in-approximability results for no-wait shop scheduling
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
We investigate the approximability of no-wait shop scheduling problems under the makespan criterion. In a flow shop, all jobs pass through the machines in the same ordering. In the more general job shop, the routes of the jobs are job-dependent. We present a polynomial time approximation scheme (PTAS) for the no-wait flow shop problem on any fixed number of machines. Unless P=NP, this result cannot be extended to the job shop problem on a fixed number of machines: We show that the no-wait job shop problem is APX-hard on (i) two machines with at most five operations per job, and on (ii) three machines with at most three operations per job.
Index Terms:
computational complexity; processor scheduling; polynomial approximation; approximability; in-approximability results; no-wait shop scheduling; makespan criterion; polynomial time approximation scheme; APX-hard
Citation:
M. Sviridenko, G.J. Woeginger, "Approximability and in-approximability results for no-wait shop scheduling," focs, pp.116, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.