Skip to main content
Log in

Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper deals with serial-batching scheduling problems with the effects of deterioration and learning, where time-dependent setup time is also considered. In the proposed scheduling models, all jobs are first partitioned into serial batches, and then all batches are processed on a single serial-batching machine. The actual job processing time is a function of its starting time and position. In addition, a setup time is required when a new batch is processed, and the setup time of the batches is time-dependent, i.e., it is a linear function of its starting time. Structural properties are derived for the problems of minimizing the makespan, the number of tardy jobs, and the maximum earliness. Then, three optimization algorithms are developed to solve them, respectively.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Mosheiov, G., Sidney, J.B.: Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147(3), 665–670 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. 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), 1–13 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gawiejnowicz, S.: Time-Dependent Scheduling, Monographs in Theoretical Computer Science, an EATCS Series. Springer, Berlin (2008)

    Google Scholar 

  8. Jafari, A., Moslehi, G.: Scheduling linear deteriorating jobs to minimize the number of tardy jobs. J. Glob. Optim. 54(2), 389–404 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Qi, X.L., Zhou, S.G., Yuan, J.J.: Single machine parallel-batch scheduling with deteriorating jobs. Theor. Comput. Sci. 410(8–10), 830–836 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yang, D.-L., Kuo, W.-H.: A single-machine scheduling problem with learning effects in intermittent batch production. Comput. Ind. Eng. 57(3), 762–765 (2009)

    Article  Google Scholar 

  11. Li, S.S., Ng, C.T., Cheng, T.C.E., Yuan, J.J.: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3), 482–488 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Miao, C.X., Zhang, Y.Z., Wu, C.L.: Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. Theor. Comput. Sci. 462(30), 80–87 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pei, J., Pardalos, P.M., Liu, X., Fan, W., Yang, S.: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur. J. Oper. Res. 244(1), 13–25 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cheng, T.C.E., Lee, W.-C., Wu, C.-C.: Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput. Ind. Eng. 58(2), 326–331 (2010)

    Article  Google Scholar 

  15. Wang, J.-B., Jiang, Y., Wang, G.: Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int. J. Adv. Manuf. Technol. 41(11–12), 1221–1226 (2009)

    Article  Google Scholar 

  16. Wu, C.-C., Lee, W.-C.: Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int. J. Prod. Econ. 115(1), 128–133 (2008)

    Article  Google Scholar 

  17. Pei, J., Liu, X., Fan, W., Pardalos, P.M., Migdalas, A., Yang, S.: Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types. Ann. Math. Artif. Intell. doi:10.1007/s10472-015-9449-7 (2015)

  18. Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S., Wang, L.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70(1–4), 335–348 (2014)

    Article  Google Scholar 

  19. Yang, S.J.: Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine. Appl. Math. Model. 35(8), 4008–4016 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Bai, J., Li, Z.R., Huang, X.: Single-machine group scheduling with general deterioration and learning effects. Appl. Math. Model. 36(3), 1267–1274 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wang, J.B., Gao, W.J., Wang, L.Y., Wang, D.: Single machine group scheduling with general linear deterioration to minimize the makespan. Int. J. Adv. Manuf. Technol. 43, 146–150 (2009)

    Article  Google Scholar 

  22. Huang, X., Wang, M.Z., Wang, J.B.: Single-machine group scheduling with both learning effects and deteriorating jobs. Comput. Ind. Eng. 60, 750–754 (2011)

    Article  Google Scholar 

  23. Wang, J.B., Huang, X., Wu, Y.B., Ji, P.: Group scheduling with independent setup times, ready times, and deteriorating job processing times. Int. J. Adv. Manuf. Technol. 60, 643–649 (2012)

    Article  Google Scholar 

  24. Wang, D., Huo, Y.Z., Ji, P.: Single-machine group scheduling with deteriorating jobs and allotted resource. Optim. Lett. 8, 591–605 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  25. Xuan, H., Tang, L.X.: Scheduling a hybrid flowshop with batch production at the last stage. Comput. Oper. Res. 34(9), 2718–2733 (2007)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  27. Cheng, T.C.E., Hsu, C.-J., Huang, Y.-C., Lee, W.-C.: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Comput. Oper. Res. 38(12), 1760–1765 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  28. 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. Discret. Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  29. Yin, Y., Cheng, S.R., Wu, C.C.: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inf. Sci. 189, 282–292 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Nos. 71231004, 71171071, 71131002, 71201042), and the Fundamental Research Funds for the Central Universities (Nos. JZ2015HGBZ0116, JZ2015HGBZ0117, JZ2015HGQC0187). Panos M. Pardalos is partially supported by the project of “Distinguished International Professor by the Chinese Ministry of Education” (MS2014HFGY026).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Pei.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pei, J., Liu, X., Pardalos, P.M. et al. Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. J Glob Optim 67, 251–262 (2017). https://doi.org/10.1007/s10898-015-0320-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-015-0320-5

Keywords

Navigation