{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:08:45Z","timestamp":1750748925536,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T00:00:00Z","timestamp":1537315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401605","11501279"],"award-info":[{"award-number":["11401605","11501279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701595"],"award-info":[{"award-number":["11701595"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10288-018-0388-0","type":"journal-article","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T14:33:57Z","timestamp":1537367637000},"page":"201-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two-agent single-machine scheduling with cumulative deterioration"],"prefix":"10.1007","volume":"17","author":[{"given":"Ren-Xia","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-1558","authenticated-orcid":false,"given":"Shi-Sheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,19]]},"reference":[{"key":"388_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multi-agent scheduling: models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Souhal A (2014) Multi-agent scheduling: models and algorithms. Springer, Berlin"},{"key":"388_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"388_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis A, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150:3\u201315","journal-title":"Ann Oper Res"},{"key":"388_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1002\/net.20023","volume":"44","author":"C Arbib","year":"2004","unstructured":"Arbib C, Smriglio S, Servilio M (2004) A competitive scheduling problem and its relevance to UMTS channel assignment. Networks 44:132\u2013141","journal-title":"Networks"},{"key":"388_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6:7\u201316","journal-title":"J Sched"},{"key":"388_CR6","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms, 5th edn. Springer, Berlin","edition":"5"},{"key":"388_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1\u201313","journal-title":"Eur J Oper Res"},{"key":"388_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng TCE, Ng CT, Yuan JJ (2006) Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor Comput Sci 362:273\u2013281","journal-title":"Theor Comput Sci"},{"key":"388_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng TCE, Ng CT, Yuan JJ (2008) Multi-agent scheduling on a single machine with max-form criteria. Eur J Oper Res 188:603\u2013609","journal-title":"Eur J Oper Res"},{"key":"388_CR10","volume-title":"Time-dependent acheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz S (2008) Time-dependent acheduling. Springer, Berlin"},{"key":"388_CR11","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1057\/jors.2010.171","volume":"62","author":"S Gawiejnowicz","year":"2011","unstructured":"Gawiejnowicz S, Lee WC, Lin CL, Wu CC (2011) Single-machine scheduling of proportionally deteriorating jobs by two agents. J Oper Res Soc 62:1983\u20131991","journal-title":"J Oper Res Soc"},{"key":"388_CR12","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.066","volume":"187","author":"C Koulamas","year":"2008","unstructured":"Koulamas C, Kyparisis GJ (2008) Single-machine scheduling with past-sequence-dependent setup times. Eur J Oper Res 187:1045\u20131049","journal-title":"Eur J Oper Res"},{"key":"388_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10951-014-0410-0","volume":"18","author":"MY Kovalyov","year":"2015","unstructured":"Kovalyov MY, Oulamara A, Soukhal A (2015) Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J Sched 18:423\u2013434","journal-title":"J Sched"},{"key":"388_CR14","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00170-008-1421-9","volume":"40","author":"WC Lee","year":"2009","unstructured":"Lee WC, Wu CC, Liu HC (2009) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Technol 40:1053\u20131056","journal-title":"Int J Adv Manuf Technol"},{"key":"388_CR15","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458\u2013469","journal-title":"Oper Res"},{"key":"388_CR16","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1080\/0305215X.2016.1227616","volume":"49","author":"SS Li","year":"2017","unstructured":"Li SS, Chen RX (2017) Common due date assignment and cumulative deterioration scheduling on a single machine. Eng Optim 49:976\u2013989","journal-title":"Eng Optim"},{"key":"388_CR17","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-69733-6_63","volume":"5092","author":"P Liu","year":"2008","unstructured":"Liu P, Tang L (2008) Two-agent scheduling with linear deteriorating jobs on a single machine. Lect Notes Comput Sci 5092:642\u2013650","journal-title":"Lect Notes Comput Sci"},{"key":"388_CR18","doi-asserted-by":"publisher","first-page":"2290","DOI":"10.1016\/j.apm.2010.11.026","volume":"35","author":"P Liu","year":"2011","unstructured":"Liu P, Yi N, Zhou X (2011) Two-agent single-machine scheduling problems under increasing linear deterioration. Appl Math Model 35:2290\u20132296","journal-title":"Appl Math Model"},{"key":"388_CR19","doi-asserted-by":"crossref","first-page":"8848","DOI":"10.1016\/j.amc.2013.03.040","volume":"219","author":"P Liu","year":"2013","unstructured":"Liu P, Yi N, Zhou X, Gong H (2013) Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Appl Math Comput 219:8848\u20138855","journal-title":"Appl Math Comput"},{"key":"388_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"CT Ng","year":"2006","unstructured":"Ng CT, Cheng TCE, Yuan JJ (2006) A note on the complexity of the problem of two-agent scheduling on a single machine. J Comb Optim 12:87\u2013394","journal-title":"J Comb Optim"},{"key":"388_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","volume":"235","author":"P Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez P, Framinan JM (2014) A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235:1\u201316","journal-title":"Eur J Oper Res"},{"key":"388_CR22","doi-asserted-by":"crossref","first-page":"6498","DOI":"10.1016\/j.amc.2011.12.020","volume":"218","author":"R Rudek","year":"2012","unstructured":"Rudek R (2012) The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect. Appl Math Comput 218:6498\u20136510","journal-title":"Appl Math Comput"},{"key":"388_CR23","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1504\/EJIE.2013.052575","volume":"7","author":"R Rudek","year":"2013","unstructured":"Rudek R (2013) Minimizing maximum lateness in a single machine scheduling problem with processing time-based aging effects. Eur J Ind Eng 7:206\u2013223","journal-title":"Eur J Ind Eng"},{"key":"388_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cie.2015.01.002","volume":"81","author":"Y Yin","year":"2015","unstructured":"Yin Y, Cheng TCE, Wan L, Wu CC, Liu J (2015) Two-agent single-machine scheduling with deteriorating jobs. Comput Ind Eng 81:177\u2013185","journal-title":"Comput Ind Eng"},{"key":"388_CR25","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s40305-016-0124-4","volume":"4","author":"JJ Yuan","year":"2016","unstructured":"Yuan JJ (2016) Complexities of some problems on multi-agent scheduling on a single machine. J Oper Res Soc China 4:379\u2013384","journal-title":"J Oper Res Soc China"},{"key":"388_CR26","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10878-016-0078-9","volume":"34","author":"JJ Yuan","year":"2017","unstructured":"Yuan JJ (2017) Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans. J Comb Optim 34:433\u2013440","journal-title":"J Comb Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0388-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0388-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0388-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T23:10:52Z","timestamp":1662073852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0388-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,19]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["388"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0388-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2018,9,19]]},"assertion":[{"value":"30 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}