Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Single-machine scheduling with logarithm deterioration

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Traditionally, job processing times are assumed to be known and fixed; however, there are many situations in which a job that is processed later consumes more time than the same job when it is processed earlier. This is known as deteriorating jobs scheduling in the literature. Most of the research in deteriorating jobs scheduling assumes that the actual job processing time is a linear function of its starting time. Thus, the actual job processing times might increase significantly if the number of jobs or the job sizes increase. Motivated by this limitation, this paper addresses a new deterioration model where the actual job processing time is a function of the logarithm of the job processing times already processed. Under the proposed model, we provide the optimal solutions for some single-machine problems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alidaee B., Womer N.K.: Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50, 711–720 (1999)

    MATH  Google Scholar 

  2. Browne S., Yechiali U.: Scheduling deteriorating jobs on a single processor. Oper. Res. 38, 495–498 (1990)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Cheng T.C.E., Ding Q., Lin B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cheng T.C.E., Wu C.C., Lee W.C.: Some scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng. 54, 972–982 (2008)

    Article  Google Scholar 

  6. Gupta J.N.D., Gupta S.K.: Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14, 387–393 (1988)

    Article  Google Scholar 

  7. Huang X., Wang J.B., Wang L.Y., Gao W.J., Wang X.R.: Single machine scheduling with time-dependent deterioration and exponential learning effect. Comput. Ind. Eng. 58, 58–63 (2010)

    Article  Google Scholar 

  8. Ji M., Cheng T.C.E.: Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan. Comput. Ind. Eng. 59, 794–798 (2010)

    Article  Google Scholar 

  9. Kunnathur A.S., Gupta S.K.: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur. J. Oper. Res. 47, 56–64 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lee W.C., Wu C.C., Wen C.C., Chung Y.H.: A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput. Ind. Eng. 54, 737–749 (2008)

    Article  Google Scholar 

  11. Ng C.T., Wang J.B., Cheng T.C.E., Liu L.L.: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput. Oper. Res. 37, 83–90 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pappis C.P., Rachaniotis N.P.: Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires. J. Heuristics 16, 617–632 (2010)

    Article  MATH  Google Scholar 

  13. Pappis C.P., Rachaniotis N.P.: Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times. Oper. Res. Int. J. 10, 27–42 (2010)

    Article  MATH  Google Scholar 

  14. Wang J.B., Ng C.T., Cheng T.C.E., Liu L.L.: Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl. Math. Comput. 180, 185–193 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wang L., Sun L.Y., Sun L.H., Wang J.B.: On three-machine flow shop scheduling with deteriorating jobs. Int. J. Prod. Econ. 125, 185–189 (2010)

    Article  Google Scholar 

  16. Wang, J.B., Wang, M.Z.: Single-machine scheduling with nonlinear deterioration. Optim. Lett. doi:10.1007/s11590-010-0253-3 (2010)

  17. Wang J.B., Xia Z.Q.: Flowshop scheduling with deteriorating jobs under dominating machines. Omega. 34, 327–336 (2006)

    Article  MathSciNet  Google Scholar 

  18. Williams T.J.E.: Analysis and Design of Hierarchical Control Systems: With Special Reference to Steel Plant Operations. North-Holland, Amsterdam (1986)

    Google Scholar 

  19. Wu C.C., Shiau Y.R., Lee W.C.: Single-machine group scheduling problems with deterioration consideration. Comput. Oper. Res. 35, 1652–1659 (2008)

    Article  MATH  Google Scholar 

  20. Yan Y., Wang D.Z., Wang D.W., Ip, W.H., Wang H.F.: Single machine group scheduling problems with the effects of deterioration and learning. Acta Automatica Sinica. 35, 1290–1295 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhao C.L., Tang H.Y.: Single machine scheduling problems with deteriorating jobs. Appl. Math. Comput. 161, 865–874 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhao, C.L., Tang, H.Y.: A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints. Optim. Lett. doi:10.1007/s11590-010-0202-1 (2010)

  23. Zhao C.L., Tang H.Y.: Scheduling deteriorating jobs under disruption. Int. J. Prod. Econ. 125, 294–299 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National Kaohsiung Normal University, Kaohsiung, Taiwan

    Peng-Jen Lai

  2. Department of Statistics, Feng Chia University, Taichung, Taiwan

    Chin-Chia Wu & Wen-Chiung Lee

Authors
  1. Peng-Jen Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wen-Chiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Chiung Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lai, PJ., Wu, CC. & Lee, WC. Single-machine scheduling with logarithm deterioration. Optim Lett 6, 1719–1730 (2012). https://doi.org/10.1007/s11590-011-0362-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0362-7

Keywords

Search

Navigation