Skip to main content
SpringerLink
Log in

A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function

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

Abstract

In order to increase the efficiency of production in a deteriorating environment through competition amongst the individual agents, this study explores a two-agent scheduling problem with one deterioration rate for each job, where the processing time of a job is a function of the position-dependent workload, resource allocation, and deterioration rate (the range of the deterioration rate is non-negative). The optimal processing sequence and resource allocation for the jobs are found by giving an upper bound of an agent to minimize the maximum value of earliness, tardiness and decision variable of another agent under slack due-date assignment. It is verified that the problem cannot be solved in polynomial time, for which various heuristic algorithms and a branch-and-bound algorithm are proposed to simulate the data to find a better range in the deterioration rate parameter.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

  • Browne S, Yechiali K (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498

    Article  Google Scholar 

  • Chen RX, Li SS (2019) Two-agent single-machine scheduling with cumulative deterioration. 4OR 17(2):201–219

    Article  MathSciNet  Google Scholar 

  • Chen RB, Yuan JJ, Geng ZC (2020) ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost. Appl Math Comput 365:124679

    MathSciNet  Google Scholar 

  • Chen Y, Xu Y, Zhang GQ, Cheng XY (2023) A single machine group scheduling problem with due date assignment and position-dependent costs. Asia-Pac J Oper Res 40(4):2340004

    Article  MathSciNet  Google Scholar 

  • Falq AE, Fouihoux P, Kedad-Sidhoum S (2022) Dominance inequalities for scheduling around an unrestrictive common due date. Eur J Oper Res 296(2):453–464

    Article  MathSciNet  Google Scholar 

  • Feng Y, Geng X-N, Lv D-Y, Wang J-B (2023) Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs. Optim Lett. https://doi.org/10.1007/s11590-023-02039-z

    Article  Google Scholar 

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

    Book  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 10(1080/01605682):2244529

    Google Scholar 

  • Lei W, Sun L, Ren N, Jia X, Wang J-B (2024) Research on delivery times scheduling with sum of logarithm processing times-based learning effect. Asia-Pac J Oper Res 41(2):2350014

  • Li L, Wang JJ (2018) Scheduling jobs with deterioration effect and controllable processing time. Neural Comput Appl 29:1163–1170

    Article  Google Scholar 

  • Li WX, Zhao CL (2015) Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval. J Appl Math Comput 48:585–605

    Article  MathSciNet  Google Scholar 

  • Li M-H, Lv D-Y, Zhang L-H, Wang J-B (2024) Permutation flow shop scheduling with makespan objective and truncated learning effects. J Appl Math Comput. https://doi.org/10.1007/s12190-024-02080-w

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Liu C, Fan Y, Zhao C, Wang JJ (2017) Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs. J Ind Manag Optim 13:713–720

    Article  MathSciNet  Google Scholar 

  • Liu WG, Wang XY, 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

    Article  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/S021759592450003

    Article  Google Scholar 

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

    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

    Article  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

    Article  Google Scholar 

  • Mao R-R, Lv D-Y, Ren N, Wang J-B (2024) Supply chain scheduling with deteriorating jobs and delivery times. J Appl Math Comput. https://doi.org/10.1007/s12190-024-02052-0

    Article  Google Scholar 

  • Miao C, Zhang Y, Cao Z (2011) Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs. Inf Process Lett 111(16):798–803

    Article  MathSciNet  Google Scholar 

  • Miao C, Song J, Zhang Y (2023) Single-machine time-dependent scheduling with proportional and delivery times. Asia-Pac J Opera Res 40(4):2240015

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

    Article  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 Combin Optim 45:100

    Article  MathSciNet  Google Scholar 

  • Pei J, Liu X, Pardalos PM, Fan W, Yang S (2017) Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Ann Oper Res 249:175–195

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Sun XY, 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

    Article  Google Scholar 

  • Sun XY, 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

    Article  MathSciNet  Google Scholar 

  • Tang L, Zhao X, Liu J, Leung JYT (2017) Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. Eur J Oper Res 263:401–411

    Article  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

    Article  Google Scholar 

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

    Article  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

    Article  Google Scholar 

  • Wang DJ, Yin Y, Xu J, Wu WH, Cheng SR, Wu CC (2015) Some due date determination scheduling problems with two agents on a single machine. Int J Prod Econ 168:81–90

    Article  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 Combin Optim 41:290–303

    Article  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

    Article  MathSciNet  Google Scholar 

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

    Article  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. https://doi.org/10.1142/10.1142/S0217595923500392

    Article  Google Scholar 

  • Wu HP, Huang M (2014) Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates. Comput Appl Math 33:557–573

    Article  MathSciNet  Google Scholar 

  • Wu CC, Wu WH, Hsu PH, Yin Y, Xu J (2014) A single-machine scheduling with a truncated linear deterioration and ready times. Inf Sci 256:109–125

    Article  MathSciNet  Google Scholar 

  • Wu W, Lv D-Y, Wang J-B (2023) Two due-date assignment scheduling with location-dependent weights and a deteriorating maintenance activity. Systems 11:150

    Article  Google Scholar 

  • Yin Y, Wu WH, Cheng TEC, Wu CC (2015) Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. Int J Comput Integr Manuf 28:781–790

    Article  Google Scholar 

  • Yin Y, Wang W, Wang D, Cheng TCE (2017) Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailable interval. Comput Ind Eng 111:202–215

    Article  Google Scholar 

  • Zhang LH, Lv DY, Wang J-B (2023) Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs. Mathematics 11:2737

    Article  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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Zhao XL, Tang LX (2015) Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine. Acta Autom Sin 41:104–112

    Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

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

    Ming-Hui Li, Dan-Yang Lv, Zheng-Guo Lv, Li-Han Zhang & Ji-Bo Wang

Authors
  1. Ming-Hui Li
    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. Zheng-Guo Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Li-Han Zhang
    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

Corresponding author

Correspondence to Ji-Bo Wang.

Ethics declarations

Conflict of interest

The authors declare there is 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

Li, MH., Lv, DY., Lv, ZG. et al. A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function. Comp. Appl. Math. 43, 229 (2024). https://doi.org/10.1007/s40314-024-02753-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-024-02753-z

Keywords

Mathematics Subject Classification

Search

Navigation