Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time

Abstract

This paper introduces the serial batching scheduling problems with position-based learning effect, where the actual job processing time is a function of its position. Two scheduling problems respectively for single-machine and parallel-machine are studied, and in each problem the objectives of minimizing maximum earliness and total number of tardy jobs are both considered respectively. In the proposed scheduling models, all jobs are first partitioned into serial batches, and then all batches are processed on the serial-batching machine. We take some practical production features into consideration, i.e., setup time before processing each batch increases with the time, regarded as time-dependent setup time, and we formalize it as a linear function of its starting time. Under the single-machine scheduling setting, structural properties are derived for the problems with the objectives of minimizing maximum earliness and number of tardy jobs respectively, based on which optimization algorithms are developed to solve them. Under the parallel-machine scheduling setting, a hybrid VNS–GSA algorithm combining variable neighborhood search (VNS) and gravitational search algorithm (GSA) is proposed to solve the problems with these two objectives respectively, and the effectiveness and efficiency of the proposed VNS–GSA are demonstrated and compared with the algorithms of GSA, VNS, and simulated annealing (SA). This paper demonstrates that the consideration of different objectives leads to various optimal decisions on jobs assignment, jobs batching, and batches sequencing, which generates a new insight to investigate batching scheduling problems with learning effect under single-machine and parallel-machine settings.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

References

  1. Bai, J., Li, Z. R., & Huang, X. (2012). Single-machine group scheduling with general deterioration and learning effects. Applied Mathematical Modelling, 36(3), 1267–1274.

    Article  Google Scholar 

  2. Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. Orsa Journal on Computing, 6, 154–160.

    Article  Google Scholar 

  3. Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173–178.

    Article  Google Scholar 

  4. Cheng, T. C. E., Hsu, C. J., Huang, Y. C., & Lee, W. C. (2011). Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Computers & Operations Research, 38(12), 1760–1765.

    Article  Google Scholar 

  5. Cheng, T. C. E., & Wang, G. (2000). Single machine scheduling with learning effect considerations. Annals of Operations Research, 98, 273–290.

    Article  Google Scholar 

  6. Damodaran, P., & Vélez-Gallego, M. C. (2012). A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. E xpert Systems with Applications, 39(1), 1451–1458.

    Article  Google Scholar 

  7. Eren, T. (2009). A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Applied Mathematical Modelling, 33, 1141–1150.

    Article  Google Scholar 

  8. Eren, T., & Güner, E. (2009). A bicriteria parallel machine scheduling with a learning effect. International Journal of Advanced Manufacturing Technology, 40(11), 1202–1205.

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Hsu, C.-J., Kuo, W.-H., & Yang, D.-L. (2011). Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects. Applied Mathematical Modelling, 35, 1492–1496.

    Article  Google Scholar 

  11. Huang, X., Wang, M. Z., & Wang, J. B. (2011). Single-machine group scheduling with both learning effects and deteriorating jobs. Computers & Industrial Engineering, 60, 750–754.

    Article  Google Scholar 

  12. Janiak, A., & Rudek, R. (2009). Experience-based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 39(2), 344–357.

    Article  Google Scholar 

  13. Kumar, A., & Tan, Y. (2015). Demand effects of joint product advertising in online videos. Management Science, 61, 1921–1937.

    Article  Google Scholar 

  14. Lee, W.-C., Wu, C.-C., & Hsu, P.-H. (2010). A single-machine learning effect scheduling problem with release times. Omega, 38, 3–11.

    Article  Google Scholar 

  15. Lei, D., & Guo, X. (2016). Variable neighborhood search for the second type of two-sided assembly line balancing problem. Computers & Operations Research, 72(C), 183–188.

    Article  Google Scholar 

  16. Lu, Y.-Y., Wei, C.-M., & Wang, J.-B. (2012). Several single-machine scheduling problems with general learning effects. Applied Mathematical Modelling, 36(11), 5650–5656.

    Article  Google Scholar 

  17. Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100.

    Article  Google Scholar 

  18. Mosheiov, G. (2001). Parallel machine scheduling with a learning effect. Journal of the Operational Research Society, 52, 1165–1169.

    Article  Google Scholar 

  19. Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147(3), 665–670.

    Article  Google Scholar 

  20. Okołowski, D., & Gawiejnowicz, S. (2010). Exact and heuristic algorithms for parallel-machine scheduling with DeJong’s learning effect. Computers & Industrial Engineering, 59(2), 272–279.

    Article  Google Scholar 

  21. Pan, E., Wang, G., Xi, L., Chen, L., & Han, X. (2014). Single-machine group scheduling problem considering learning, forgetting effects and preventive maintenance. International Journal of Production Research, 52(19), 5690–5704.

    Article  Google Scholar 

  22. Paul, A., Tan, Y., & Vakharia, A. (2015). Inventory planning for a modular product family. Production and Operations Management, 24(7), 1033–1053.

    Article  Google Scholar 

  23. Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2015b). Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optimization Letters, 9(1), 91–104.

    Article  Google Scholar 

  24. Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2017b). Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Annals of Operations Research, 249, 175–195.

    Article  Google Scholar 

  25. Pei, J., Liu, X., Pardalos, P. M., Li, K., Fan, W., & Migdalas, A. (2016). Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. Optimization Letters. doi:10.1007/s11590-016-1074-9.

  26. Pei, J., Liu, X., Pardalos, P. M., Migdalas, A., & Yang, S. (2017a). Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. Journal of Global Optimization, 67(1), 251–262.

    Article  Google Scholar 

  27. Pei, J., Pardalos, P. M., Liu, X., Fan, W., & Yang, S. (2015a). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operational Research, 244(1), 13–25.

    Article  Google Scholar 

  28. Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems (2nd ed.). Upper Saddle River, NJ: Prentice-Hall.

    Google Scholar 

  29. Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009). GSA: A gravitational search algorithm. Information Science, 179(13), 223–2248.

    Article  Google Scholar 

  30. Tan, Y., & Carrillo, J. (2017). Strategic analysis of the agency model for digital goods. Production and Operations Management. doi:10.1111/poms.12595.

  31. Tan, Y., Carrillo, J., & Cheng, H. K. (2016). The agency model for digital goods. Decision Science, 4, 628–660.

    Article  Google Scholar 

  32. Teyarachakul, S., Chand, S., & Ward, J. (2011). Effect of learning and forgetting on batch sizes. Production and Operations Management, 20(1), 116–128.

    Article  Google Scholar 

  33. Wang, D., Huo, Y. Z., & Ji, P. (2014a). Single-machine group scheduling with deteriorating jobs and allotted resource. Optimization Letters, 8, 591–605.

  34. Wang, H.-M., & Chou, F.-D. (2010). Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Systems with Applications, 37, 1510–1521.

    Article  Google Scholar 

  35. Wang, J. B., Huang, X., Wu, Y. B., & Ji, P. (2012). Group scheduling with independent setup times, ready times, and deteriorating job processing times. International Journal of Advanced Manufacturing Technology, 60, 643–649.

    Article  Google Scholar 

  36. Wang, J. B., Ng, C. T., Cheng, T. C. E., & Liu, L. L. (2008). Single-machine scheduling with a time-dependent learning effect. International Journal of Production Economics, 111, 802–811.

    Article  Google Scholar 

  37. Wang, J.-B., & Wang, J.-J. (2014). Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects. Optimization Letters, 8(3), 971–982.

    Article  Google Scholar 

  38. Wang, X.-R., Wang, J.-B., & Jin, J. (2014b). Single machine scheduling with truncated job-dependent learning effect. Optimization Letters, 8(2), 669–677.

  39. Xuan, H., & Tang, L. (2007). Scheduling a hybrid flowshop with batch production at the last stage. Computers & Operations Research, 34(9), 2718–2733.

    Article  Google Scholar 

  40. Yang, D. L., & Kuo, W. H. (2009). A single-machine scheduling problem with learning effects in intermittent batch production. Computers & Industrial Engineering, 57(3), 762–765.

    Article  Google Scholar 

  41. Yang, W. H., & Chard, S. (2008). Learning and forgetting effects on a group scheduling problem. European Journal of Operational Research, 187(3), 1033–1044.

    Article  Google Scholar 

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

    Article  Google Scholar 

  43. Zhu, Z., Chu, F., Sun, L., & Liu, M. (2013). Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity. Applied Mathematical Modelling, 37(7), 5371–5380.

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Nos. 71601065, 71231004, 71501058, 71671055, 71690235), and Innovative Research Groups of the National Natural Science Foundation of China (71521001), the Humanities and Social Sciences Foundation of the Chinese Ministry of Education (No. 15YJC630097), Anhui Province Natural Science Foundation (No. 1608085QG167), and the Fundamental Research Funds for the Central Universities (Nos. JZ2016HGTA0709, JZ2016HGTB0727). Panos M. Pardalos is partially supported by the project of “Distinguished International Professor by the Chinese Ministry of Education” (MS2014HFGY026).

Author information

Affiliations

Authors

Corresponding authors

Correspondence to Jun Pei or Xinbao Liu.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Pei, J., Cheng, B., Liu, X. et al. Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann Oper Res 272, 217–241 (2019). https://doi.org/10.1007/s10479-017-2481-8

Download citation

Keywords

  • Scheduling
  • Serial-batching
  • Learning effect
  • Single-machine
  • Parallel-machine
  • Setup time