Skip to main content
Springer Nature Link
Log in

Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Under common due window assignment, a single machine scheduling problem with learning effect, delivery time and convex resource allocation is considered. Actual processing time is related to normal processing time, job dependent learning effect and allocated resources. There are three objective functions are considered. They involve earliness, tardiness, due window costs and resource costs with position dependent weights. The first objective function is to minimize the total costs of earliness, tardiness, start time of window, window size and resource allocation; the second objective function is to minimize the total costs of earliness, tardiness, start time of window and window size under resource-limited conditions; the third objective function is to minimize the cost of resource allocation under the scheduling function constraint. The goal is to determine the optimal sequence and resource allocation. All three problems are proved that they can be solved in polynomial time and polynomial time algorithms are given separately.

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

Algorithm 1
Algorithm 2
Algorithm 3

Similar content being viewed by others

References

  1. Wang, J.-B., Xia, Z.-Q.: Flow shop scheduling with a learning effect. J. Oper. Res. Soc. 56(11), 1325–1330 (2005)

    Article  Google Scholar 

  2. Wang, J.-B., Wang, L,-Y., Wang, D., Wang, X.-Y., Gao, W.-J., Yin, N.: Single machine scheduling problems with position-dependent processing times. J. Appl. Math. Comput. 30, 293–304 (2009)

  3. Azzouz, A., Ennigrou, M., Said, L.B.: Scheduling problems under learning effects: classification and cartography. Int. J. Prod. Res. 56(4), 1642–1661 (2018)

    Article  Google Scholar 

  4. Liang, X.-X., Zhang, B., Wang, J.-B., Yin, N., Huang, X.: Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects. J. Appl. Math. Comput. 61, 373–388 (2019)

    Article  MathSciNet  Google Scholar 

  5. 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)

    Article  MathSciNet  Google Scholar 

  6. Qian, J., Zhan, Y.: Single-machine group scheduling model with position-dependent and job-dependent DeJong’s learning effect. Mathematics 10(14), 2454 (2022)

    Article  Google Scholar 

  7. Qian, J.: Note on single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 186, 109750 (2023)

    Article  Google Scholar 

  8. Wang, J.-B., Zhang, L.-H., Lv, Z.-G., Lv, D.-Y., Geng, X.-N., Sun, X.: Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects. Comput. Appl. Math. 41, 417 (2022)

    Article  MathSciNet  Google Scholar 

  9. Gao, J., Zou, J., Zhang, Y.: Single-machine scheduling with a deteriorating maintenance activity and DeJong’s learning effect. Int. J. Found. Comput. Sci. (2022). https://doi.org/10.1142/S0129054122460030

    Article  Google Scholar 

  10. Ferraro, A., Rossit, D.A., Toncovich, A.: Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users. J. Comput. Appl. Math. 424(1), 114983 (2023)

    Article  MathSciNet  Google Scholar 

  11. Koulamas, C., Kyparisis, G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187, 1045–1049 (2008)

    Article  MathSciNet  Google Scholar 

  12. Sun, L., Zhang, X.H., Ning, L.: Results of parallel-machine scheduling model with maintenance activity considering time-dependent deterioration, delivery times, and resource allocation. Math. Probl. Eng. 2021, 8826345 (2021)

    Article  Google Scholar 

  13. Qian, J., Zhan, Y.: The due date assignment scheduling problem with delivery times and truncated sum-of-processing-times-based learning effect. Mathematics 9(23), 3085 (2021)

    Article  Google Scholar 

  14. Wang, J.-B., Xue, J., Cui, B., Gao, M.: Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times. Asia. Pac. J. Oper. Res. 39(2), 2150013 (2022)

    Article  MathSciNet  Google Scholar 

  15. Qian, J., Han, H.: The due date assignment scheduling problem with the deteriorating jobs and delivery time. J. Appl. Math. Comput. 68, 2173–2186 (2022)

    Article  MathSciNet  Google Scholar 

  16. Zhang, C., Li, Y., Cao, J., Yang, Z., Coelho, L.C.: Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date. Comput. Oper. Res. 147, 105936 (2022)

    Article  MathSciNet  Google Scholar 

  17. Qian, J., Zhan, Y.: The due window assignment problems with deteriorating job and delivery time. Mathematics 10(10), 2454 (2022)

    Article  Google Scholar 

  18. Qian, J., Han, H.Y.: Improved algorithms for proportionate flow shop scheduling with due-window assignment. Ann. Oper. Res. 309, 249–258 (2022)

    Article  MathSciNet  Google Scholar 

  19. Qian, J., Chang, G.: A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 16, 2645–2648 (2022)

    Article  MathSciNet  Google Scholar 

  20. Wang, S.-H., Lv, D.-Y., Wang, J.-B.: Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect. J. Ind. Manag. Optim. 19(4), 2824–2837 (2023)

    Article  MathSciNet  Google Scholar 

  21. Ren, N., Lv, D.-Y., Wang, J.-B., Wang, X.-Y.: Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times. J. Ind. Manag. Optim. 19(11), 8429–8450 (2023)

    Article  MathSciNet  Google Scholar 

  22. Ren, N., Wang, J.-B., Wang, E.: Research on delivery times scheduling with truncated learning effects. Comput. Appl. Math. 42, 243 (2023)

    Article  MathSciNet  Google Scholar 

  23. Pan, L., Sun, X., Wang, J.-B., Zhang, L.-H., Lv, D.-Y.: Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs. J. Combin. Optim. 45, 100 (2023)

    Article  MathSciNet  Google Scholar 

  24. Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing times. Disc. Appl. Math. 155, 1643–1666 (2007)

    Article  MathSciNet  Google Scholar 

  25. Yedidsiona, L., Shabtay, D.: The resource dependent assignment problem with a convex agent cost function. Eur. J. Oper. Res. 261, 486–502 (2017)

    Article  MathSciNet  Google Scholar 

  26. Wang, J.-B., Wang, M.-Z.: Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia Pac. J. Oper. Res. 31(5), 1450036 (2014)

    Article  MathSciNet  Google Scholar 

  27. Wang, J.-B., Liang, X.-X.: Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Eng. Optim. 51(2), 231–246 (2019)

    Article  MathSciNet  Google Scholar 

  28. Sun, X., Geng, X.-N., Wang, J.-B., Liu, F.: Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect. Int. J. Prod. Res. 57(6), 1873–1897 (2019)

    Article  Google Scholar 

  29. Geng, X.-N., Wang, J.-B., Bai, D.: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 51(8), 1301–1323 (2019)

    Article  MathSciNet  Google Scholar 

  30. Liu, W., Jiang, C.: Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52(1), 74–89 (2020)

    Article  MathSciNet  Google Scholar 

  31. Shi, H.-B., Wang, J.-B.: Research on common due window assignment flowshop scheduling with learning effect and resource allocation. Eng. Optim. 52(4), 669–686 (2020)

    Article  MathSciNet  Google Scholar 

  32. Sun, L., Yu, A.J., Wu, B.: Single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 139, 106126 (2020)

    Article  Google Scholar 

  33. Lv, D.-Y., Wang, J.-B.: Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects. Asia-Pac. J. Oper. Res. 38(6), 2150008 (2021)

    Article  MathSciNet  Google Scholar 

  34. Yan, J.-X., Ren, N., Bei, H.-B., Bao, H., Wang, J.-B.: Scheduling with resource allocation, deteriorating effect and group technology to minimize total completion time. Mathematics 10(16), 2983 (2022)

    Article  Google Scholar 

  35. Zhang, L.-H., Lv, D.-Y., Wang, J.-B.: Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs. Mathematics 11, 2737 (2023)

    Article  Google Scholar 

  36. Wang, J.-B., Wang, Y.-C., Wan, C., Lv, D.-Y., Zhang, L.: Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia-Pac. J. Oper. Res. https://doi.org/10.1142/S0217595923500264

  37. Wang, Y.-C., Wang, J.-B.: Study on convex resource allocation scheduling with a time-dependent learning effect. Mathematics 11, 3179 (2023)

    Article  Google Scholar 

  38. Shioura, A., Strusevich, V.A., Shakhlevich, N.V.: Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. https://doi.org/10.1007/s10951-023-00782-w

  39. 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. Disc. Math. 5, 287—326 (1979)

  40. Wang, J.-B., Zhang, B., Li, L., Bai, D., Feng, Y.-B.: Due window assignment scheduling problems with position-dependent weights on a single machine. Eng. Optim. 52(2), 185–193 (2020)

    Article  MathSciNet  Google Scholar 

  41. Wang, J.-B., Cui, B., Ji, P., Liu, W.-W.: Research on scheduling with position-dependent weights and past-sequence-dependent delivery times. J. Combin. Optim. 41(2), 290–303 (2021)

    Article  MathSciNet  Google Scholar 

  42. Wang, J.-B., Bao, H., Wang, C.: Research on multiple slack due-date assignments scheduling with position-dependent weights. Asia-Pac. J. Oper. Res. https://doi.org/10.1142/S0217595923500392

  43. Huang, X.: Bicriterion scheduling with group technology and deterioration effect. J. Appl. Math. Comput. 60, 455–464 (2019)

    Article  MathSciNet  Google Scholar 

  44. Huang, X., Yin, N., Liu, W.-W., Wang, J.-B.: Common due window assignment scheduling with proportional linear deterioration effects. Asia-Pac. J. Oper. Res. 37(1), 1950031 (2020)

    Article  MathSciNet  Google Scholar 

  45. Zhang, L.-H., Geng, X.-N., Xue, J., Wang, J.-B.: Single machine slack due window assignment and deteriorating jobs. J. Ind. Manag. Optim. 20(4), 1593–1614 (2024)

    Article  MathSciNet  Google Scholar 

  46. Lv, D.-Y., Xue, J., Wang, J.-B.: Minmax common due-window assignment scheduling with deteriorating jobs. J. Oper. Res. Soc. China., https://doi.org/10.1007/s40305-023-00511-2

Download references

Acknowledgements

This research was supported by the National Natural Science Foundation of China (Grant No. 12171074).

Author information

Authors and Affiliations

  1. Department of Mathematics, Northeastern University, Shenyang, 110819, People’s Republic of China

    Jin Qian, Guisong Chang & Xue Zhang

Authors
  1. Jin Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guisong Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xue Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin Qian.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qian, J., Chang, G. & Zhang, X. Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations. J. Appl. Math. Comput. 70, 1965–1994 (2024). https://doi.org/10.1007/s12190-024-02023-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-024-02023-5

Keywords

Mathematics Subject Classification