Job Shop Scheduling Problems with Controllable Processing Times
Most scheduling models assume that the jobs have fixed processing times. However, in real-life applications the processing time of a job often depends on the amount of resources such as facilities, manpower, funds, etc. allocated to it, and so its processing time can be reduced when additional resources are assigned to the job. A scheduling problem in which the processing times of the jobs can be reduced at some expense is called a scheduling problem with controllable processing times. In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. 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.
KeywordsProcessing Time Schedule Problem Feasible Schedule Polynomial Time Approximation Scheme Medium Operation
Unable to display preview. Download preview PDF.
- 5.K. Jansen, R. Solis-Oba and M. I. Sviridenko, A linear time approximation scheme for the job shop scheduling problem, Proceedings of the Second International Workshop on Approximation Algorithms (APPROX 99), 177–188.Google Scholar
- 6.E. L. Lawler, (1977) “Fast Approximation Algorithms for Knapsack Problems”, 18th Annual Symposium on Foundations of Computer Science, 206–213.Google Scholar