{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:24:38Z","timestamp":1781821478319,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s40314-024-02753-z","type":"journal-article","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T11:01:58Z","timestamp":1715079718000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function"],"prefix":"10.1007","volume":"43","author":[{"given":"Ming-Hui","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan-Yang","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng-Guo","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li-Han","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,7]]},"reference":[{"key":"2753_CR1","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali K (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495\u2013498","journal-title":"Oper Res"},{"issue":"2","key":"2753_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10288-018-0388-0","volume":"17","author":"RX Chen","year":"2019","unstructured":"Chen RX, Li SS (2019) Two-agent single-machine scheduling with cumulative deterioration. 4OR 17(2):201\u2013219","journal-title":"4OR"},{"key":"2753_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.124697","volume":"365","author":"RB Chen","year":"2020","unstructured":"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","journal-title":"Appl Math Comput"},{"issue":"4","key":"2753_CR4","doi-asserted-by":"publisher","first-page":"2340004","DOI":"10.1142\/S0217595923400043","volume":"40","author":"Y Chen","year":"2023","unstructured":"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","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"2753_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.ejor.2021.03.048","volume":"296","author":"AE Falq","year":"2022","unstructured":"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\u2013464","journal-title":"Eur J Oper Res"},{"key":"2753_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-023-02039-z","author":"Y Feng","year":"2023","unstructured":"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","journal-title":"Optim Lett"},{"key":"2753_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and algorithms of time-dependent scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz S (2020) Models and algorithms of time-dependent scheduling. Springer, Berlin"},{"issue":"1080\/01605682","key":"2753_CR8","first-page":"2244529","volume":"10","author":"S Kovalev","year":"2023","unstructured":"Kovalev S, Chalamon I, B\u00e9cuwe 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","journal-title":"J Oper Res Soc"},{"key":"2753_CR9","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1142\/S0217595923500148"},{"key":"2753_CR10","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/s00521-016-2630-z","volume":"29","author":"L Li","year":"2018","unstructured":"Li L, Wang JJ (2018) Scheduling jobs with deterioration effect and controllable processing time. Neural Comput Appl 29:1163\u20131170","journal-title":"Neural Comput Appl"},{"key":"2753_CR11","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s12190-014-0820-3","volume":"48","author":"WX Li","year":"2015","unstructured":"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\u2013605","journal-title":"J Appl Math Comput"},{"key":"2753_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-024-02080-w","author":"M-H Li","year":"2024","unstructured":"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","journal-title":"J Appl Math Comput"},{"key":"2753_CR13","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.3390\/pr11041271","volume":"11","author":"WG Liu","year":"2023","unstructured":"Liu WG, Wang XY (2023) Group technology scheduling with due-date assignment and controllable processing times. Processes 11:1271","journal-title":"Processes"},{"key":"2753_CR14","doi-asserted-by":"publisher","first-page":"713","DOI":"10.3934\/jimo.2016042","volume":"13","author":"C Liu","year":"2017","unstructured":"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\u2013720","journal-title":"J Ind Manag Optim"},{"issue":"1","key":"2753_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.3934\/jimo.2023079","volume":"20","author":"WG Liu","year":"2024","unstructured":"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\u2013324","journal-title":"J Ind Manag Optim"},{"key":"2753_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/S021759592450003","author":"D-Y Lv","year":"2024","unstructured":"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","journal-title":"Asia-Pac J Oper Res"},{"key":"2753_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-023-00511-2","author":"D-Y Lv","year":"2023","unstructured":"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","journal-title":"J Oper Res Soc China"},{"key":"2753_CR18","doi-asserted-by":"publisher","first-page":"610","DOI":"10.3390\/math12040610","volume":"12","author":"Z-G Lv","year":"2024","unstructured":"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","journal-title":"Mathematics"},{"key":"2753_CR19","doi-asserted-by":"publisher","first-page":"3983","DOI":"10.3390\/math11183983","volume":"11","author":"R-R Mao","year":"2023","unstructured":"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","journal-title":"Mathematics"},{"key":"2753_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-024-02052-0","author":"R-R Mao","year":"2024","unstructured":"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","journal-title":"J Appl Math Comput"},{"issue":"16","key":"2753_CR21","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1016\/j.ipl.2011.05.018","volume":"111","author":"C Miao","year":"2011","unstructured":"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\u2013803","journal-title":"Inf Process Lett"},{"issue":"4","key":"2753_CR22","doi-asserted-by":"publisher","first-page":"2240015","DOI":"10.1142\/S0217595922400152","volume":"40","author":"C Miao","year":"2023","unstructured":"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","journal-title":"Asia-Pac J Opera Res"},{"issue":"8","key":"2753_CR23","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1080\/01605682.2019.1621222","volume":"71","author":"B Mor","year":"2020","unstructured":"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\u20131325","journal-title":"J Oper Res Soc"},{"key":"2753_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s10878-023-01025-6","volume":"45","author":"L Pan","year":"2023","unstructured":"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","journal-title":"J Combin Optim"},{"key":"2753_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10479-015-1824-6","volume":"249","author":"J Pei","year":"2017","unstructured":"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\u2013195","journal-title":"Ann Oper Res"},{"key":"2753_CR26","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s12190-021-01607-9","volume":"68","author":"J Qian","year":"2022","unstructured":"Qian J, Han HY (2022) The due date assignment scheduling problem with the deteriorating jobs and delivery time. J Appl Math Comput 68:2173\u20132186","journal-title":"J Appl Math Comput"},{"key":"2753_CR27","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.3390\/math10101672","volume":"10","author":"J Qian","year":"2022","unstructured":"Qian J, Zhan Y (2022) The due window assignment problems with deteriorating job and delivery time. Mathematics 10:1672","journal-title":"Mathematics"},{"key":"2753_CR28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"XY Sun","year":"2020","unstructured":"Sun XY, Geng X-N, Liu T (2020) Due-window assignment scheduling in the proportionate flow shop setting. Ann Oper Res 292:113\u2013131","journal-title":"Ann Oper Res"},{"issue":"12","key":"2753_CR29","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"XY Sun","year":"2021","unstructured":"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\u20132689","journal-title":"J Oper Res Soc"},{"key":"2753_CR30","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10951-022-00756-4","volume":"26","author":"XY Sun","year":"2023","unstructured":"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\u2013266","journal-title":"J Sched"},{"key":"2753_CR31","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2017.05.019","volume":"263","author":"L Tang","year":"2017","unstructured":"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\u2013411","journal-title":"Eur J Oper Res"},{"key":"2753_CR32","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1057\/jors.2011.40","volume":"63","author":"J-B Wang","year":"2012","unstructured":"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\u2013137","journal-title":"J Oper Res Soc"},{"key":"2753_CR33","doi-asserted-by":"publisher","first-page":"3179","DOI":"10.3390\/math11143179","volume":"11","author":"Y-C Wang","year":"2023","unstructured":"Wang Y-C, Wang J-B (2023) Study on convex resource allocation scheduling with a time-dependent learning effect. Mathematics 11:3179","journal-title":"Mathematics"},{"key":"2753_CR34","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1057\/jors.2010.120","volume":"62","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, Wang J-J, Ji P (2011) Scheduling jobs with chain precedence constraints and deteriorating jobs. J Oper Res Soc 62:1765\u20131770","journal-title":"J Oper Res Soc"},{"key":"2753_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ijpe.2015.06.018","volume":"168","author":"DJ Wang","year":"2015","unstructured":"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\u201390","journal-title":"Int J Prod Econ"},{"key":"2753_CR36","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s10878-020-00676-z","volume":"41","author":"J-B Wang","year":"2021","unstructured":"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\u2013303","journal-title":"J Combin Optim"},{"issue":"8","key":"2753_CR37","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s40314-022-02133-5","volume":"41","author":"J-B Wang","year":"2022","unstructured":"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","journal-title":"Comput Appl Math"},{"key":"2753_CR38","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595923500264","author":"J-B Wang","year":"2023","unstructured":"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","journal-title":"Asia-Pac J Oper Res"},{"key":"2753_CR39","doi-asserted-by":"publisher","DOI":"10.1142\/10.1142\/S0217595923500392","author":"J-B Wang","year":"2024","unstructured":"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","journal-title":"Asia-Pac J Oper Res"},{"key":"2753_CR40","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s40314-013-0081-z","volume":"33","author":"HP Wu","year":"2014","unstructured":"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\u2013573","journal-title":"Comput Appl Math"},{"key":"2753_CR41","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ins.2013.08.030","volume":"256","author":"CC Wu","year":"2014","unstructured":"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\u2013125","journal-title":"Inf Sci"},{"key":"2753_CR42","doi-asserted-by":"publisher","first-page":"150","DOI":"10.3390\/systems11030150","volume":"11","author":"W Wu","year":"2023","unstructured":"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","journal-title":"Systems"},{"key":"2753_CR43","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1080\/0951192X.2014.900872","volume":"28","author":"Y Yin","year":"2015","unstructured":"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\u2013790","journal-title":"Int J Comput Integr Manuf"},{"key":"2753_CR44","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cie.2017.07.013","volume":"111","author":"Y Yin","year":"2017","unstructured":"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\u2013215","journal-title":"Comput Ind Eng"},{"key":"2753_CR45","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.3390\/math11122737","volume":"11","author":"LH Zhang","year":"2023","unstructured":"Zhang LH, Lv DY, Wang J-B (2023) Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs. Mathematics 11:2737","journal-title":"Mathematics"},{"key":"2753_CR46","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.3934\/jimo.2023136","volume":"20","author":"L-H Zhang","year":"2024","unstructured":"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\u20131614","journal-title":"J Ind Manag Optim"},{"issue":"4","key":"2753_CR47","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","volume":"41","author":"S Zhao","year":"2022","unstructured":"Zhao S (2022) Scheduling jobs with general truncated learning effects including proportional setup times. Comput Appl Math 41(4):146","journal-title":"Comput Appl Math"},{"key":"2753_CR48","first-page":"104","volume":"41","author":"XL Zhao","year":"2015","unstructured":"Zhao XL, Tang LX (2015) Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine. Acta Autom Sin 41:104\u2013112","journal-title":"Acta Autom Sin"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02753-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02753-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02753-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T02:06:01Z","timestamp":1718071561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02753-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,7]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2753"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02753-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,7]]},"assertion":[{"value":"24 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"229"}}