Skip to main content
Springer Nature Link
Log in

Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

This paper studies the single machine scheduling problems with truncated logarithm processing times and exponential past-sequence-dependent delivery times. We prove that the makespan and total completion time minimizations are polynomially solvable. For the total weighted completion time minimization, we illustrate that it remains polynomially solvable under a special case; under the general case, this paper proposes heuristic, tabu search and branch-and-bound algorithms. Computational experiments indicate that the heuristic algorithm is more effective than tabu search algorithm.

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

Fig. 1

Similar content being viewed by others

Data Availability

The data used to support the findings of this paper are available from the corresponding author upon request.

References

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

    Google Scholar 

  • Brucker P (2007) Scheduling algorithms, 2nd edn. Springer, Heidelberg

    Google Scholar 

  • Heuser P, Tauer B (2023) Single-machine scheduling with product category-based learning and forgetting effects. Omega 115:102786

    Google Scholar 

  • Koulamas C, Kyparisis GJ (2010) Single-machine scheduling problems with past-sequence-dependent delivery times. Int J Prod Econ 126:264–266

    Google Scholar 

  • Kovalev S, Chalamon I, Bécuwe A (2023) Single machine scheduling with resource constraints: equivalence to two-machine flow-shop scheduling for regular objectives. J Oper Res Soc. https://doi.org/10.1080/01605682.2023.2244529

    Article  Google Scholar 

  • Lei W, Sun L, Ren N, Jia X, Wang J-B (2023) Research on delivery times scheduling with sum of logarithm processing times-based learning effect. Asia-Pac J Oper Res. https://doi.org/10.1142/S0217595923500148

    Article  Google Scholar 

  • Liu WG, Wang X (2023) Group technology scheduling with due-date assignment and controllable processing times. Processes 11:1271

    Google Scholar 

  • Liu M, Zheng F, Chu C, Xu Y (2012) New results on single-machine scheduling with past-sequence-dependent delivery times. Theoret Comput Sci 438:55–61

    MathSciNet  Google Scholar 

  • Liu WG, Wang X, Li L, Dai W (2024) Due-window assignment scheduling with job-rejection, truncated learning effects and setup times. J Ind Manag Optim 20(1):313–324

    MathSciNet  Google Scholar 

  • Lv D-Y, Wang J-B (2024) No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia-Pac J Oper Res. https://doi.org/10.1142/S0217595924500039

    Article  Google Scholar 

  • Lv Z-G, Zhang L-H, Wang X-Y, Wang J-B (2024) Single machine scheduling proportionally deteriorating jobs with ready times subject to the total weighted completion time minimization. Mathematics 12:610

    Google Scholar 

  • Ma R, Guo SA, Zhang XY (2023) An optimal online algorithm for single-processor scheduling problem with learning effect. Theoret Comput Sci 928:1–12

    MathSciNet  Google Scholar 

  • Maecker S, Shen LJ, Mönch L (2023) Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Comput Oper Res 149:105999

    MathSciNet  Google Scholar 

  • Mao R-R, Wang Y-C, Lv D-Y, Wang J-B, Lu Y-Y (2023) Delivery times scheduling with deterioration effects in due window assignment environments. Mathematics 11:3983

    Google Scholar 

  • Mor B, Shapira D (2020) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc 71(8):1315–1325

    Google Scholar 

  • Nawaz M, Enscore JEE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91–95

    Google Scholar 

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

    MathSciNet  Google Scholar 

  • Paredes-Astudillo YA, Botta-Genoulaz V, Montoya-Torrers JR (2023) Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm. Int J Prod Res. https://doi.org/10.1142/10.1080/00207543.2023.2204967

    Article  Google Scholar 

  • Pei J, Zhou Y, Yan P, Pardalos PM (2023) A concise guide to scheduling with learning and deteriorating effects. Int J Prod Res 61:2010–2031

    Google Scholar 

  • Pinedo ML (2015) Scheduling theory, algorithms, and systems, 5th edn. Springer, Heidelberg

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Google Scholar 

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

    MathSciNet  Google Scholar 

  • Shen L-X, Wu Y-B (2013) Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects. Appl Math Model 37:5444–5451

    MathSciNet  Google Scholar 

  • Sun L-H, Sun L-Y, Wang J-B (2011) Single-machine scheduling to minimize total absolute differences in waiting times under simple linear deterioration. J Oper Res Soc 62:768–775

    Google Scholar 

  • Sun X, Geng X-N, Liu F (2021) Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. J Oper Res Soc 72(12):2674–2689

    Google Scholar 

  • Sun X, Liu T, Geng X-N, Hu Y, Xu J-X (2023) Optimization of scheduling problems with deterioration effects and an optional maintenance activity. J Sched 26:251–266

    MathSciNet  Google Scholar 

  • Toksari MD, Aydogan EK, Atalay B, Sari S (2022) Some scheduling problems with sun of logarithm processing times based learning effect and exponential past sequence dependent delivery times. J Ind Manag Optim 18:1795–1807

    MathSciNet  Google Scholar 

  • Wang J-B, Wang M-Z (2012) Worst-case analysis for flow shop scheduling problems with an exponential learning effect. J Oper Res Soc 63:130–137

    Google Scholar 

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

    Google Scholar 

  • Wang J-J, Wang J-B, Liu F (2011) Parallel machines scheduling with a deteriorating maintenance activity. J Oper Res Soc 62:1898–1902

    Google Scholar 

  • Wang J-B, Wang J-J, Ji P (2011) Scheduling jobs with chain precedence constraints and deteriorating jobs. J Oper Res Soc 62:1765–1770

    Google Scholar 

  • Wang J-B, Liu F, Wang J-J (2019) Research on m-machine flow shop scheduling with truncated learning effects. Int Trans Oper Res 26(3):1135–1151

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  • Wang X, Liu WG, Li L, Zhao P, Zhang R (2022) Resource dependent scheduling with truncated learning effects. Math Biosci Eng 19(6):5957–5967

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  • Wang D, Fang K, Luo W, Ouyang W (2024) Approximation algorithms for mixed batch scheduling on parallel machines. J Oper Res Soc. https://doi.org/10.1080/01605682.2024.2314251

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Wu Y-B, Wang J-J (2016) Single-machine scheduling with truncated sum-of-processing-times based learning effect including proportional delivery times. Neural Comput Appl 27:937–943

    Google Scholar 

  • Wu C-C, Yin Y, Wu W-H, Cheng S-R (2012) Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect. Eur J Ind Eng 6:441–453

    Google Scholar 

  • Wu C-C, Yin Y, Cheng S-R (2013) Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J Oper Res Soc 64:147–156

    Google Scholar 

  • Xin X, Jiang Q, Li C, Li S, Chen K (2023) Permutation flow shop energy-efficient scheduling with position-based learning effect. Int J Prod Res 61:382–409

    Google Scholar 

  • Yang S-J, Yang D-L (2012) Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times. J Oper Res Soc 63:1508–1515

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  • Zhao S (2022) Scheduling jobs with general truncated learning effects including proportional setup times. Comput Appl Math 41(4):146

    MathSciNet  Google Scholar 

  • Zhao C-L, Tang H-Y (2014) Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J Appl Math Comput 45:259–274

    MathSciNet  Google Scholar 

Download references

Funding

This work was supported by the Science Research Foundation of Educational Department of Liaoning Province (LJKMZ20220532).

Author information

Authors and Affiliations

  1. School of Science, Shenyang Aerospace University, Shenyang, 110136, People’s Republic of China

    Xiao-Yuan Wang, Dan-Yang Lv, Na Yin & Ji-Bo Wang

  2. Department of Management Science and Engineering, Khalifa University of Science and Technology, P O Box 127788, Abu Dhabi, UAE

    Ping Ji

  3. School of Management, Xi’an Jiaotong University, Xi’an, People’s Republic of China

    Xiao-Yuan Wang

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

    Jin Qian

Authors
  1. Xiao-Yuan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan-Yang Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ping Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Na Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jin Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-Bo Wang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflicts 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

Wang, XY., Lv, DY., Ji, P. et al. Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times. Comp. Appl. Math. 43, 194 (2024). https://doi.org/10.1007/s40314-024-02717-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-024-02717-3

Keywords

Mathematics Subject Classification