Skip to main content
Springer Nature Link
Log in

Scheduling to Minimize Makespan with Time-Dependent Processing Times

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

Abstract

In this paper we study the scheduling problem of minimizing makespan on identical parallel machines with time-dependent processing times. We first consider the problem with time-dependent processing times on two identical machines to minimize makespan, which is NP-hard. We give a fully polynomial-time approximation scheme for the problem. Furthermore, we generalize the result to the case with m machines.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Behzad, M., Chartrand, G., Wall, C.: On minimal regular digraphs with given girth. Fund. Math. 69, 227–231 (1970)

    MATH  MathSciNet  Google Scholar 

  2. Bachman, A., Janiak, A.: Minimizing maximum lateness under linear deterioration. European Journal of Operational Research 126, 557–566 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bachman, A., Janiak, A., Kovalyov, M.Y.: Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters 81, 81–84 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Browne, S., Yechiali, U.: Scheduling deteriorating jobs on a single processor. Operations Research 38, 495–498 (1990)

    Article  MATH  Google Scholar 

  5. Cheng, T.C.E., Kang, L., Ng, C.T.: Due-date assignment and single machine scheduling with deteriorating jobs. Journal of Operational Research Society 55, 198–203 (2004)

    Article  MATH  Google Scholar 

  6. Cheng, T.C.E., Ding, Q., Kovalyov, M.Y., Bachman, A., Janiak, A.: Scheduling jobs with piecewise linear decreasing processing times. Naval Research Logistics 50, 531–554 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152, 1–13 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cheng, T.C.E., Ding, Q.: Single machine scheduling with deadlines and increasing rates of processing times. Acta Informatica 36, 673–692 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chen, Z.L.: Parallel machine scheduling with time-dependent processing times. Discrete Applied Mathematics 70, 81–93 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Chen, Z.L.: A note on single-processor scheduling with time dependent execution time. Operational Research Letter 17, 127–129 (1995)

    Article  MATH  Google Scholar 

  11. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering 14, 387–394 (1988)

    Article  Google Scholar 

  13. Gupta, S.K., Kunnathur, A.S., Dandapani, K.: Optimal repayment polices for multiple loans. OMEGA 15, 323–330 (1987)

    Article  Google Scholar 

  14. Ho, K.I.J., Leung, J.Y.T., Wei, W.D.: Complexity of scheduling tasks with time dependent execution time. Information Processing Letter 48, 315–320 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kovalyov, M.Y., Kubiak, W.: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics 3, 287–297 (1998)

    Article  MATH  Google Scholar 

  16. Mosheiov, G.: Multi-machines scheduling with linear deterioration. INFOR 36, 205–214 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shanghai University, Shanghai, 200444, China

    L. Y. Kang & M. Zhao

  2. Department of Logistics, The Hong Kong Polytechnic University,  

    L. Y. Kang, T. C. E. Cheng & C. T. Ng

Authors
  1. L. Y. Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. C. E. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. T. Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, L.Y., Cheng, T.C.E., Ng, C.T., Zhao, M. (2005). Scheduling to Minimize Makespan with Time-Dependent Processing Times. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_92

Download citation

  • DOI: https://doi.org/10.1007/11602613_92

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics