Job Shop Scheduling Problems with Controllable Processing Times

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial time approximation schemes when the number of machines and the number of operations per job are fixed.

• Type: Conference
• Year: 2001
• Where: ICTCS
• Authors: Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
• Keywords: Controllable Processing Times, ICTCS 2001, Job Shop Scheduling, Polynomial Time Approximation, Theoretical Computer Science