Skip to main content
Log in

Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs

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

Abstract

This article studies the single-machine scheduling problem with due date assignments, deteriorating jobs, and past-sequence-dependent delivery times. Under three assignments (i.e., common, slack, and different due dates), the goal is to determine a feasible sequence and due dates of all jobs in order to minimize the weighted sum of earliness, tardiness, and due date costs of all jobs, where the weight is not related to the job but to the position in which some job is scheduled. Through a series of optimal properties, efficient and fast polynomial time algorithms are designed for solving the studied scheduling problem with three due date assignments.

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

Data availibility

No data were generated or analyzed in support of this research.

References

  • Brucker P (2001) Scheduling algorithms, 3rd edn. Springer, Berlin

    Book  MATH  Google Scholar 

  • Chen Y, Ma X, Zhang G, Cheng Y (2023) On optimal due date assignment without restriction and resource allocation in group technology scheduling. J Comb Optim 45:64

  • Cheng TCE, Kravchenko SA, Lin BMT (2020) Scheduling step-deteriorating jobs to minimize the total completion time. Comput Ind Eng 144:106329

    Article  Google Scholar 

  • Gawiejnowicz S (2020) Models and algorithms of time-dependent scheduling. Springer, Berlin

    Book  MATH  Google Scholar 

  • Gordon VS, Proth JM, Chu CB (2002) A survey of the state of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139:1–25

    Article  MathSciNet  MATH  Google Scholar 

  • Gordon VS, Proth JM, Chu CB (2002) Due date assignment and scheduling: SLK, TWK and other due date assignment models. Prod Plan Control 13:117–132

    Article  Google Scholar 

  • Ji M, Ge Yao DL, JJ, Cheng TCE (2015) Single-machine slack due-window assignment and scheduling with past-sequence-dependent delivery times and controllable job processing times. Eur J Ind Eng 9:794–818

    Article  Google Scholar 

  • Jiang C, Zou D, Bai D, Wang J-B (2020) Proportionate flowshop scheduling with position-dependent weights. Eng Optim 52(1):37–52

    Article  MathSciNet  MATH  Google Scholar 

  • Koulamas C (2017) Common due date assignment with generalized earliness/tardiness penalties. Comput Ind Eng 109:79–83

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Li S-S, Chen R-X, Feng Q, Jiao C-W (2019) Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J Comb Optim 38:957–971

    Article  MathSciNet  MATH  Google Scholar 

  • Liu W, Hu X, Wang X (2017) Single machine scheduling with slack due dates assignment. Eng Optim 49:709–717

    Article  MathSciNet  Google Scholar 

  • Liu W-W, Yao Y, Jiang C (2020) Single-machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights. Eng Optim 52:701–714

    Article  MathSciNet  MATH  Google Scholar 

  • Lv D-Y, Wang J-B (2021) Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim Lett 15(6):2311–2319

    Article  MathSciNet  MATH  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

    Article  MathSciNet  MATH  Google Scholar 

  • Sun X, Geng X-N, Liu T (2020) Due-window assignment scheduling in the proportionate flow shop setting. Ann Oper Res 292:113–131

    Article  MathSciNet  MATH  Google Scholar 

  • T’kindt V, Shang L, Croce FD (2020) Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. J Comb Optim 39:764–775

    Article  MathSciNet  MATH  Google Scholar 

  • Toksari, MD, Guner, E (2010) The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration. Expert Syst Appl 37:92–112

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

    Article  MathSciNet  MATH  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

    Article  MathSciNet  MATH  Google Scholar 

  • Xiong X, Wang D, Cheng TCE, Wu C-C, Yin Y (2018) Single-machine scheduling and common due date assignment with potential machine disruption. Int J Prod Res 56(3):1345–1360

    Article  Google Scholar 

  • Yang Y, Yin G, Wang C, Yin Y (2022) Due date assignment and two-agent scheduling under multitasking environment. J Comb Optim 44(4):2207–2223

    Article  MathSciNet  MATH  Google Scholar 

  • Yin Y, Wu W-H, Cheng TCE, Wu C-C (2014) Due date assignment and single-machine scheduling with generalized positional deteriorating jobs and deteriorating multi-maintenance activities. Int J Prod Res 52:2311–2326

    Article  Google Scholar 

  • Yin Y, Wang D, Wu C-C, Cheng TCE (2016) CON/SLK due date assignment and scheduling on a single machine with two agents. Nav Res Logist 63:416–429

    Article  MathSciNet  MATH  Google Scholar 

  • Yin Y, Yang Y, Wang D, Cheng TCE, Wu C-C (2018) Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Nav Res Logist 65:393–409

    Article  MathSciNet  MATH  Google Scholar 

  • Yin Y, Li D, Wang D, Cheng TCE (2021) Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann Oper Res 298:497–523

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank three anonymous reviewers for their valuable suggestions and comments.

Funding

This work was supported by the National Key Research and Development Program of China (2021YFB3301801) and the National Natural Science Foundation of China (71971165). This work was also supported by LiaoNing Revitalization Talents Program (Grant No. XLYC2002017).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Xinyu Sun or Ji-Bo Wang.

Ethics declarations

Conflict of interest

No potential conflict of interest was reported by the authors.

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

Pan, L., Sun, X., Wang, JB. et al. Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs. J Comb Optim 45, 100 (2023). https://doi.org/10.1007/s10878-023-01025-6

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10878-023-01025-6

Keywords

Navigation