[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Parallel machines scheduling with deteriorating and learning effects

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

Abstract

In this paper parallel identical machines scheduling problems with deteriorating jobs and learning effects are considered. In this model, job processing times are defined by functions of their starting times and positions in the sequence. We concentrate on two goals separately, namely, minimizing a cost function containing total completion time and total absolute differences in completion times; minimizing a cost function containing total waiting time and total absolute differences in waiting times. We show that the problems remain polynomially solvable under the proposed model.

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

Access this article

Subscribe and save

Springer+ Basic
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

  2. Gawiejnowicz S.: Time-Dependent Scheduling. Springer, Berlin (2008)

    MATH  Google Scholar 

  3. Biskup D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115, 173–178 (1999)

    Article  MATH  Google Scholar 

  4. Cheng T.C.E., Wang G.: Single machine scheduling with learning effect considerations. Ann. Oper. Res. 98, 273–290 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Biskup D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 118, 315–329 (2008)

    Article  MathSciNet  Google Scholar 

  6. Lee W.-C.: A note on deteriorating jobs and learning in single-machine scheduling problems. Int. J. Bus. Econ. 3, 83–89 (2004)

    Google Scholar 

  7. Wang J.-B.: A note on scheduling problems with learning effect and deteriorating jobs. Int. J. Syst. Sci. 37, 827–833 (2006)

    Article  MATH  Google Scholar 

  8. Wang J.-B.: Single-machine scheduling problems with the effects of learning and deterioration. Omega 35, 397–402 (2007)

    Article  Google Scholar 

  9. Wang J.-B., Cheng T.C.E.: Scheduling problems with the effects of deterioration and learning. Asia-Pac. J. Oper. Res. 24, 245–261 (2007)

    Article  MathSciNet  Google Scholar 

  10. Wang X., Cheng T.C.E.: Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur. J. Oper. Res. 178, 57–70 (2007)

    Article  MATH  Google Scholar 

  11. 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 

  12. Wang J.-B.: Single machine scheduling with a time-dependent learning effect and deteriorating jobs. J. Oper. Res. Soc. 60, 583–586 (2009)

    Article  Google Scholar 

  13. Toksari M.D., Guner E.: The commondue-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration. Expert Syst. Appl. 37, 92–112 (2009)

    Article  Google Scholar 

  14. Yang D.-L., Kuo W.-H.: Some scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng. 58, 25–28 (2010)

    Article  Google Scholar 

  15. Yang D.-L., Kuo W.-H.: A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects. J. Oper. Res. Soc. 62, 206–210 (2011)

    Article  Google Scholar 

  16. Huang X., Wang M.-Z.: Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties. Appl. Math. Model. 35, 1349–1353 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nembhard D.A., Osothsilp N.: Task complexity effects on between-individual learning/forgetting variability. Int. J. Ind. Ergon. 29, 297–306 (2002)

    Article  Google Scholar 

  18. 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 

  19. Hardy G.H., Littlewood J.E., Polya G.: Inequalities. Cambridge University Press, Cambridge (1967)

    Google Scholar 

  20. Kanet J.J.: Minimizing variation of flow time in single machine systems. Manag. Sci. 27(12), 1453–1459 (1981)

    Article  MATH  Google Scholar 

  21. Bagchi U.B.: Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Oper. Res. 37, 118–125 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  22. Mosheiov G.: Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines. J. Oper. Res. Soc. 59, 1422–1424 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xue Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X., Wang, MZ. & Ji, P. Parallel machines scheduling with deteriorating and learning effects. Optim Lett 8, 493–500 (2014). https://doi.org/10.1007/s11590-012-0490-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0490-8

Keywords

Navigation