{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:48:48Z","timestamp":1767192528242,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T00:00:00Z","timestamp":1611100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T00:00:00Z","timestamp":1611100800000},"content-version":"vor","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":["12071442","11771406"],"award-info":[{"award-number":["12071442","11771406"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10878-021-00697-2","type":"journal-article","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T04:45:06Z","timestamp":1611117906000},"page":"504-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work"],"prefix":"10.1007","volume":"41","author":[{"given":"Ruyan","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-615X","authenticated-orcid":false,"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,20]]},"reference":[{"key":"697_CR1","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":"697_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling: models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin"},{"key":"697_CR3","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":"697_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","volume":"24","author":"J Blazewicz","year":"1987","unstructured":"Blazewicz J, Finke G (1987) Minimizing mean weighted execution time loss on identical and uniform processors. Inf Process Lett 24:259\u2013263","journal-title":"Inf Process Lett"},{"key":"697_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2001","unstructured":"Brucker P (2001) Scheduling algorithms. Springer, Berlin"},{"key":"697_CR6","first-page":"21","volume-title":"Handbook of combinatorial optimization","author":"B Chen","year":"1998","unstructured":"Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic Publishers, Dordrecht, pp 21\u2013169"},{"key":"697_CR7","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1002\/nav.21869","volume":"66","author":"RB Chen","year":"2019","unstructured":"Chen RB, Yuan JJ, Ng CT, Cheng TCE (2019a) Single-machine scheduling with deadlines to minimize the total weighted late work. Naval Res Logist 66:582\u2013595","journal-title":"Naval Res Logist"},{"key":"697_CR8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10951-018-0598-5","volume":"22","author":"RB Chen","year":"2019","unstructured":"Chen RB, Yuan JJ, Gao Y (2019b) The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J Sched 22:581\u2013593","journal-title":"J Sched"},{"key":"697_CR9","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. Theoret Comput Sci 362:273\u2013281","journal-title":"Theoret Comput Sci"},{"key":"697_CR10","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":"697_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disopt.2017.02.004","volume":"25","author":"Y Gao","year":"2017","unstructured":"Gao Y, Yuan JJ (2017) Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. Discrete Optim 25:105\u2013119","journal-title":"Discrete Optim"},{"key":"697_CR12","doi-asserted-by":"publisher","unstructured":"Gao Y, Yuan JJ, Ng CT, Cheng TCE (2020) A note on competing-agent Pareto-scheduling. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-020-01576-1","DOI":"10.1007\/s11590-020-01576-1"},{"key":"697_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","volume":"7","author":"AMA Hariri","year":"1995","unstructured":"Hariri AMA, Potts CN, Van Wassenhove LN (1995) Single machine scheduling to minimize total weighted late work. ORSA J Comput 7:232\u2013242","journal-title":"ORSA J Comput"},{"key":"697_CR14","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.3390\/math8091517","volume":"8","author":"RY He","year":"2020","unstructured":"He RY, Yuan JJ (2020) Two-agent preemptive Pareto-scheduling to minimize late work and other criteria. Mathematics 8:1517","journal-title":"Mathematics"},{"key":"697_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-68874-4_9","volume-title":"Mathematical programming-the state of the art","author":"EL Lawler","year":"1983","unstructured":"Lawler EL (1983) Recent results in the theory of machine scheduling. In: Bachem A et al (eds) Mathematical programming-the state of the art. Springer, Berlin, pp 202\u2013234"},{"key":"697_CR16","doi-asserted-by":"publisher","first-page":"3098","DOI":"10.1016\/j.apm.2010.01.015","volume":"34","author":"WC Lee","year":"2010","unstructured":"Lee WC, Wang WJ, Shiau YR, Wu CC (2010) A single-machine scheduling problem with two-agent and deteriorating jobs. Appl Math Model 34:3098\u20133107","journal-title":"Appl Math Model"},{"key":"697_CR17","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":"697_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10951-020-00646-7","volume":"23","author":"SS Li","year":"2020","unstructured":"Li SS, Yuan JJ (2020) Single-machine scheduling with multi-agents to minimize total weighted late work. J Sched 23:497\u2013512","journal-title":"J Sched"},{"key":"697_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.cor.2019.06.004","volume":"111","author":"P Liu","year":"2019","unstructured":"Liu P, Gu M, Li G (2019) Two-agent scheduling on a single machine with release dates. Comput Oper Res 111:35\u201342","journal-title":"Comput Oper Res"},{"key":"697_CR20","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore JM (1968) An $$n$$ job, one machine sequencing algorithm for minimizing the number of late jobs. Manage Sci 15:102\u2013109","journal-title":"Manage Sci"},{"key":"697_CR21","doi-asserted-by":"publisher","first-page":"387","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 Combin Optim 12:387\u2013394","journal-title":"J Combin Optim"},{"key":"697_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","volume":"244","author":"D Oron","year":"2015","unstructured":"Oron D, Shabtay D, Steiner G (2015) Single machine scheduling with two competing agents and equal jobs processing times. Eur J Oper Res 244:86\u201399","journal-title":"Eur J Oper Res"},{"key":"697_CR23","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1991","unstructured":"Potts CN, Van Wassenhove LN (1991a) Single machine scheduling to minimize total late work. Oper Res 40:586\u2013595","journal-title":"Oper Res"},{"key":"697_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"CN Potts","year":"1991","unstructured":"Potts CN, Van Wassenhove LN (1991b) Approximation algorithms for scheduling a single machine to minimize total late work. Oper Res Lett 11:261\u2013266","journal-title":"Oper Res Lett"},{"key":"697_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120\u2013129","journal-title":"Omega"},{"key":"697_CR26","unstructured":"T\u2019kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, Berlin"},{"key":"697_CR27","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.amc.2015.10.059","volume":"273","author":"L Wan","year":"2016","unstructured":"Wan L, Yuan JJ, Wei LJ (2016) Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. Appl Math Comput 273:912\u2013923","journal-title":"Appl Math Comput"},{"key":"697_CR28","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s11590-017-1141-x","volume":"12","author":"JJ Yuan","year":"2018","unstructured":"Yuan JJ (2018) Complexities of four problems on two-agent scheduling. Optimization Letters 12:763\u2013780","journal-title":"Optimization Letters"},{"key":"697_CR29","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"JJ Yuan","year":"2005","unstructured":"Yuan JJ, Shang WP, Feng Q (2005a) A note on the scheduling with two families of jobs. J Sched 8:537\u2013542","journal-title":"J Sched"},{"key":"697_CR30","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.ejor.2003.10.043","volume":"164","author":"JJ Yuan","year":"2005","unstructured":"Yuan JJ, Lin YX (2005b) Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. Eur J Oper Res 164:851\u2013855","journal-title":"Eur J Oper Res"},{"key":"697_CR31","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":"697_CR32","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s10878-016-0017-9","volume":"33","author":"XG Zhang","year":"2017","unstructured":"Zhang XG, Wang Y (2017) Two-agent scheduling problems on a single-machine to minimize the total weighted late work. J Combin Optim 33:945\u2013955","journal-title":"J Combin Optim"},{"key":"697_CR33","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s10878-018-0337-z","volume":"37","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Yuan JJ (2019) A note on a two-agent scheduling problem related to the total weighted late work. J Combin Optim 37:989\u2013999","journal-title":"J Combin Optim"},{"key":"697_CR34","doi-asserted-by":"publisher","unstructured":"Zhang Y, Yuan JJ, Ng CT, Cheng TCE (2020) Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work. Naval Res Logist. https:\/\/doi.org\/10.1002\/nav.21961","DOI":"10.1002\/nav.21961"},{"key":"697_CR35","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.orl.2019.10.009","volume":"47","author":"QL Zhao","year":"2019","unstructured":"Zhao QL, Yuan JJ (2019) A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. Oper Res Lett 47:607\u2013610","journal-title":"Oper Res Lett"},{"key":"697_CR36","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10878-019-00507-w","volume":"39","author":"QL Zhao","year":"2020","unstructured":"Zhao QL, Yuan JJ (2020) Bicriteria scheduling of equal length jobs on uniform parallel machines. J Combin Optim 39:637\u2013661","journal-title":"J Combin Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00697-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-021-00697-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00697-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T05:45:41Z","timestamp":1618897541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-021-00697-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,20]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["697"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00697-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,1,20]]},"assertion":[{"value":"9 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2021","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":"Our manuscript has no associated data.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability Statement"}}]}}