Advertisement

Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects

  • Xi-Xi Liang
  • Bo Zhang
  • Ji-Bo WangEmail author
  • Na Yin
  • Xue Huang
Original Research
  • 13 Downloads

Abstract

This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum of the quadratic job completion times, respectively. Heuristic algorithms based on the optimal schedules for the corresponding flow shop scheduling problems are presented and their worst-case error bounds are also analyzed.

Keywords

Scheduling Heuristic algorithm Flow shop Learning effect 

Mathematics Subject Classification

90B35 68M20 

Notes

Acknowledgements

This research was supported by the Support Program for Innovative Talents in Liaoning University of China (Grant No. LR2016017), the Liaoning BaiQianWan Talents Program of China, and the Foundation of Education Department of Liaoning (China) (L201753).

References

  1. 1.
    Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26, 36–52 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Smutnicki, C.: Some results of worst-case analysis for flow shop scheduling. Eur. J. Oper. Res. 109, 66–87 (1998)CrossRefzbMATHGoogle Scholar
  3. 3.
    Hoogeveen, J.A., Kawaguchi, T.: Minimizing total completion time in a two-machine flowshop: analysis of special cases. Math. Oper. Res. 24, 887–910 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Koulamas, C., Kyparisis, G.J.: Algorithms with performance guarantees for flow shops with regular objective functions. IIE Trans. 37, 1107–1111 (2005)CrossRefGoogle Scholar
  5. 5.
    Easwaran, G., Parten, L.E., Moras, R., Uhlig, P.X.: Makespan minimization in machine dominated flowshop scheduling. Appl. Math. Comput. 217, 110–116 (2010)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Upper Saddle River (2002)zbMATHGoogle Scholar
  7. 7.
    Biskup, D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115, 173–178 (1999)CrossRefzbMATHGoogle Scholar
  8. 8.
    Biskup, D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188, 315–329 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Wang, J.-B., Ng, C.T., Cheng, T.C.E., Liu, L.-L.: Single-machine scheduling with a time-dependent learning effect. Int. J. Prod. Econ. 111, 802–811 (2008)CrossRefGoogle Scholar
  10. 10.
    Cheng, T.C.E., Lai, P.-J., Wu, C.-C., Lee, W.-C.: Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Inf. Sci. 197, 3127–3135 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Eren, T.: A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl. Math. Model. 33, 1141–1150 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Lee, W.-C., Wu, C.-C.: Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations. Inf. Sci. 179, 3885–3892 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Yin, Y., Xu, D., Sun, K., Li, H.: Some scheduling problems with general position-dependent and time-dependent learning effects. Inf. Sci. 179, 2416–2425 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Yin, Y., Wu, C.-C., Wu, W.-H., Cheng, S.-R.: The single-machine total weighted tardiness scheduling problem with position-based learning effects. Comput. Oper. Res. 39, 1109–1116 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Wu, C.-C., Yin, Y., Cheng, S.-R.: Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J. Oper. Res. Soc. 64, 147–156 (2013)CrossRefGoogle Scholar
  16. 16.
    Yin, Y., Wu, W.-H., Wu, W.-H., Wu, C.-C.: A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf. Sci. 256, 91–108 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Zhao, C.-L., Tang, H.: Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J. Appl. Math. Comput. 45, 259–274 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Wang, J.-B., Xia, Z.-Q.: Flow shop scheduling with a learning effect. J. Oper. Res. Soc. 56, 1325–1330 (2005)CrossRefzbMATHGoogle Scholar
  19. 19.
    Xu, Z., Sun, L., Gong, J.: Worst-case analysis for flow shop scheduling with a learning effect. Int. J. Prod. Econ. 113, 748–753 (2008)CrossRefGoogle Scholar
  20. 20.
    Wang, J.-B., Wang, M.-Z.: Worst-case analysis for flow shop scheduling problems with an exponential learning effect. J. Oper. Res. Soc. 63, 130–137 (2012)CrossRefGoogle Scholar
  21. 21.
    Li, G., Wang, X.-Y., Wang, J.-B., Sun, L.-Y.: Worst case analysis of flow shop scheduling problems with a time-dependent learning effect. Int. J. Prod. Econ. 142, 98–104 (2013)CrossRefGoogle Scholar
  22. 22.
    Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., He, X.-C.: Some results of the worst-case analysis for flow shop scheduling with a learning effect. Ann. Oper. Res. 211, 481–490 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Wang, J.-B., Wang, M.-Z.: Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Ann. Oper. Res. 191, 155–169 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., He, X.-C.: Research on permutation flow shop scheduling problems with general position-dependent learning effects. Ann. Oper. Res. 211, 473–480 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Wang, X.-Y., Zhou, Z., Zhang, X., Ji, P., Wang, J.-B.: Several flow shop scheduling problems with truncated position-based learning effect. Comput. Oper. Res. 40, 2906–2929 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Wang, J.-J., Zhang, B.-H.: Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Comput. Oper. Res. 58, 24–31 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    He, H.: Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect. Comput. Ind. Eng. 97, 73–83 (2016)CrossRefGoogle Scholar
  28. 28.
    Bai, D., Tang, M., Zhang, Z.-H., Santibanez-Gonzalez, E.D.R.: Flow shop learning effect scheduling problem with release dates. Omega 78, 21–38 (2018)CrossRefGoogle Scholar
  29. 29.
    Wang, J.-B., Liu, F., Wang, J.-J.: Research on m-machine flow shop scheduling with truncated learning effects. Int. Trans. Oper. Res. 26(3), 1135–1151 (2019)MathSciNetCrossRefGoogle Scholar
  30. 30.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Townsend, W.: The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manag. Sci. 24, 530–534 (1978)CrossRefzbMATHGoogle Scholar
  32. 32.
    Smith, W.E.: Various optimizers for single state production. Nav. Res. Log. Q. 3, 59–66 (1956)CrossRefGoogle Scholar
  33. 33.
    Wu, C.-C., Chen, J.-Y., Lin, W.-C., Lai, K., Liu, S.-C., Yu, P.-W.: A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization. Swarm Evol. Comput. 41, 97–110 (2018)CrossRefGoogle Scholar
  34. 34.
    Wu, C.-C., Wang, D., Sheng, S.-R., Chung, L., Lin, W.-C.: A two-stage three-machine assembly scheduling problem with a position-based learning effect. Int. J. Prod. Res. 56(9), 3064–3079 (2018)CrossRefGoogle Scholar
  35. 35.
    Wang, J.-B., Wang, J., Niu, Y.-P.: A single machine scheduling with learning effect and controllable processing times. J. Shenyang Aerosp. Univ. 31(5), 82–86 (2014) (in Chinese)Google Scholar
  36. 36.
    Niu, Y.-P., Wang, J., Yin, N.: Scheduling problems with effects of deterioration and truncated job-dependent learning. J. Appl. Math. Comput. 47, 315–325 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  37. 37.
    Yin, N.: Single-machine due-window assignment resource allocation scheduling with job-dependent learning effect. J. Appl. Math. Comput. 56, 715–725 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  38. 38.
    Fan, Y.-P., Zhao, C.-L.: Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration. J. Appl. Math. Comput. 46, 51–66 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  39. 39.
    Li, W.-X., Zhao, C.-L.: Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval. J. Appl. Math. Comput. 48, 585–605 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    Wang, J.-B., Guo, M.-M., Liu, H., Li, L., Wang, D.: Survey on flow shop scheduling problems with start time dependent deteriorating jobs. J. Shenyang Aerosp. Univ. 33(3), 1–10 (2016) (in Chinese)Google Scholar
  41. 41.
    Wang, J.-B., Zhao, B.-L.: Research on single-machine group scheduling with independent setup times and deterioration effect. J. Shenyang Aerosp. Univ. 34(4), 82–87 (2017) (in Chinese)Google Scholar
  42. 42.
    Huang, X.: Bicriterion scheduling with group technology and deterioration effect. J. Appl. Math. Comput. (2018).  https://doi.org/10.1007/s12190-018-01222-1 Google Scholar

Copyright information

© Korean Society for Computational and Applied Mathematics 2019

Authors and Affiliations

  • Xi-Xi Liang
    • 1
  • Bo Zhang
    • 1
  • Ji-Bo Wang
    • 1
    Email author
  • Na Yin
    • 1
  • Xue Huang
    • 1
  1. 1.School of ScienceShenyang Aerospace UniversityShenyangPeople’s Republic of China

Personalised recommendations