Advertisement

Job Shop Scheduling Problems with Controllable Processing Times

  • Klaus Jansen
  • Monaldo Mastrolilli
  • Roberto Solis-Oba
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2202)

Abstract

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.

Keywords

Processing Time Schedule Problem Feasible Schedule Polynomial Time Approximation Scheme Medium Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. M. Anstreicher, Linear programming in \( O(\tfrac{{n^3 }} {{\ln n}}L) \) operations, SIAM Journal on Optimization, Vol. 9, No. 4, (1999), pp. 803–812.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Z. L. Chen, Q. Lu, G. Tang, Single machine scheduling with discretely controllable processing times, Operations Research Letters, 21 (1997), pp. 69–76.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    T. C. E. Cheng, N. Shakhlevich, Proportionate flow shop with controllable processing times, Journal of Scheduling, Volume 2, Number 6, 1999, pp. 253–265.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    M. Grigoriadis and L. Khachiyan, Coordination complexity of parallel pricedirective decomposition, Mathematics of Operations Research, 21(2), 1996, pp. 321–340.MATHMathSciNetGoogle Scholar
  5. 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. 6.
    E. L. Lawler, (1977) “Fast Approximation Algorithms for Knapsack Problems”, 18th Annual Symposium on Foundations of Computer Science, 206–213.Google Scholar
  7. 7.
    E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbook in Operations Research and Management Science, Vol. 4, North-Holland, 1993, 445–522.CrossRefGoogle Scholar
  8. 8.
    E. Nowicki and S. Zdrzalka, A survey of results for sequencing problems with controllable processing times, Discrete Applied Mathematics, 26, 1990, pp. 271–287.CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    E. Nowicki and S. Zdrzalka, A two-machine flow shop scheduling problem with controllable job processing times, European Journal of Operational Research, 34, 1988, pp. 208–220.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    E. Nowicki, An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing time, European Journal of Operational Research, 70 (1993), pp. 342–349.MATHCrossRefGoogle Scholar
  11. 11.
    S. V. Sevastianov, Bounding algorithms for the routing problem with arbitrary paths and alternative servers, Cybernetics (in Russian), 22, 1986, pp. 773–780.CrossRefGoogle Scholar
  12. 12.
    D. B. Shmoys and E. Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming, 62, 1993, pp. 461–470.CrossRefMathSciNetGoogle Scholar
  13. 13.
    M. Trick, Scheduling multiple variable-speed machines, Operations research, 42, 1994, pp.234–248.MATHGoogle Scholar
  14. 14.
    R. G. Vickson, Two single machine sequencing problems involving controllable job processing times, AIIE Transactions, 12, 1980, pp. 258–262.MathSciNetGoogle Scholar
  15. 15.
    R. G. Vickson, Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine, Operations Research, 28, 1980, pp. 1155–1167.MATHMathSciNetGoogle Scholar
  16. 16.
    D. Williamson, L. Hall, J. Hoogeveen, C. Hurkens, J. Lenstra, S. Sevastianov, and D. Shmoys, Short shop schedules, Operations Research 45 (1997), 288–294.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Klaus Jansen
    • 1
  • Monaldo Mastrolilli
    • 2
  • Roberto Solis-Oba
    • 3
  1. 1.Institut für Informatik und Praktische MathematikUniversität zu KielGermany
  2. 2.IDSIASwitzerland
  3. 3.Department of Computer ScienceThe University of Western OntarioCanada

Personalised recommendations