{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:44Z","timestamp":1740141884423,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M652555"],"award-info":[{"award-number":["2019M652555"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901539","12071442"],"award-info":[{"award-number":["11901539","12071442"]}],"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":["11771406"],"award-info":[{"award-number":["11771406"]}],"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":[[2022,6]]},"DOI":"10.1007\/s10288-021-00480-3","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T19:02:27Z","timestamp":1621882947000},"page":"273-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost"],"prefix":"10.1007","volume":"20","author":[{"given":"Yuan","family":"Gao","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,5,24]]},"reference":[{"key":"480_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":"480_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":"480_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":"480_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker P, Gladky A, Hoogeveen H, Kovalyov MY, Potts CN, Taut-enhahn T, van de Velde SL (1998) Scheduling a batching machine. J Sched 1:31\u201354","journal-title":"J Sched"},{"key":"480_CR5","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 (2019) 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":"480_CR6","doi-asserted-by":"publisher","first-page":"98702","DOI":"10.1109\/ACCESS.2019.2929582","volume":"7","author":"CY Cheng","year":"2019","unstructured":"Cheng CY, Li SF, Ying KC, Liu YH (2019) Scheduling jobs of two competing agents on a single machine. IEEE Access 7:98702\u201398714","journal-title":"IEEE Access"},{"key":"480_CR7","doi-asserted-by":"publisher","first-page":"7071","DOI":"10.1016\/j.apm.2013.03.013","volume":"37","author":"Q Feng","year":"2013","unstructured":"Feng Q, Yuan JJ, Liu HL, He C (2013) A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives. Appl Math Model 37:7071\u20137076","journal-title":"Appl Math Model"},{"key":"480_CR8","doi-asserted-by":"crossref","unstructured":"Gao Y (2020) Min-max scheduling of batch or drop-line jobs under agreeable release and processing. Asia-Pac J Oper Res (Accepted for publication)","DOI":"10.1142\/S0217595921500238"},{"key":"480_CR9","doi-asserted-by":"crossref","unstructured":"Gao Y, Yuan JJ, Ng CT, Cheng TCE (2021) A note on competing-agent Pareto-scheduling. Optim Lett 15:249\u2013262","DOI":"10.1007\/s11590-020-01576-1"},{"key":"480_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2014.12.020","volume":"570","author":"ZC Geng","year":"2015","unstructured":"Geng ZC, Yuan JJ (2015a) Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness. Theoret Comput Sci 570:22\u201329","journal-title":"Theoret Comput Sci"},{"key":"480_CR11","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ipl.2015.07.002","volume":"115","author":"ZC Geng","year":"2015","unstructured":"Geng ZC, Yuan JJ (2015b) A note on unbounded parallel-batch scheduling. Inf Process Lett 115:969\u2013974","journal-title":"Inf Process Lett"},{"key":"480_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"3","key":"480_CR13","first-page":"109","volume":"22","author":"C He","year":"2018","unstructured":"He C, Han XX (2018) Two-agent scheduling on an unbounded parallel-batching machine to minimize maximum cost and makespan. Oper Res Trans 22(3):109\u2013116","journal-title":"Oper Res Trans"},{"key":"480_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":"480_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.tcs.2007.04.034","volume":"381","author":"C He","year":"2007","unstructured":"He C, Lin YX, Yuan JJ (2007) Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theoret Comput Sci 381:234\u2013240","journal-title":"Theoret Comput Sci"},{"key":"480_CR16","doi-asserted-by":"publisher","first-page":"1450025","DOI":"10.1142\/S0217595914500250","volume":"31","author":"C He","year":"2014","unstructured":"He C, Lin H, Yuan JJ, Mu YD (2014) Batching machine scheduling with bicriteria: maximum cost and makespan. Asia-Pac J Oper Res 31:1450025","journal-title":"Asia-Pac J Oper Res"},{"key":"480_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.omega.2018.08.001","volume":"83","author":"D Hermelin","year":"2019","unstructured":"Hermelin D, Kubitza JM, Shabtay D, Talmon N, Woeginger GJ (2019) Scheduling two agents on a single machine: a parameterized analysis of NP-hard problems. Omega Int J Manag Sci 83:275\u2013286","journal-title":"Omega Int J Manag Sci"},{"key":"480_CR18","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592\u2013623","journal-title":"Eur J Oper Res"},{"key":"480_CR19","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40:764\u2013775","journal-title":"Oper Res"},{"key":"480_CR20","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1080\/0305215X.2019.1678609","volume":"52","author":"SS Li","year":"2020","unstructured":"Li SS, Chen RX, Tian J (2020a) Multitasking scheduling problems with two competitive agents. Eng Optim 52:1940\u20131956","journal-title":"Eng Optim"},{"key":"480_CR21","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.3934\/jimo.2019005","volume":"16","author":"HW Li","year":"2020","unstructured":"Li HW, Gajpal Y, Bector CR (2020b) A survey of due-date related single-machine with two-agent scheduling problem. J Ind Manag Optim 16:1329\u20131347","journal-title":"J Ind Manag Optim"},{"key":"480_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 job processing times. Eur J Oper Res 244:86\u201399","journal-title":"Eur J Oper Res"},{"key":"480_CR23","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 problem with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235:1\u201316","journal-title":"Eur J Oper Res"},{"key":"480_CR24","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V Tkindt","year":"2006","unstructured":"Tkindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, Berlin","edition":"2"},{"key":"480_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.064","author":"L Wan","year":"2020","unstructured":"Wan L, Mei JJ, Du JZ (2020) Two-agent scheduling with unit processing time to minimize total weighted completion time and total weighted number of tardy jobs. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2020.07.064","journal-title":"Eur J Oper Res"},{"key":"480_CR26","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":"480_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-016-0479-8","volume":"20","author":"JJ Yuan","year":"2017","unstructured":"Yuan JJ (2017) Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J Sched 20:211\u2013218","journal-title":"J Sched"},{"key":"480_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-017-1141-x","author":"JJ Yuan","year":"2018","unstructured":"Yuan JJ (2018) Complexities of four problems on two-agent scheduling. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-017-1141-x","journal-title":"Optim Lett"},{"key":"480_CR29","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1016\/j.ejor.2019.07.072","volume":"280","author":"JJ Yuan","year":"2020","unstructured":"Yuan JJ, Ng CT, Cheng TCE (2020) Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur J Oper Res 280:860\u2013875","journal-title":"Eur J Oper Res"},{"key":"480_CR30","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":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-021-00480-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-021-00480-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-021-00480-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T13:05:20Z","timestamp":1653656720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-021-00480-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["480"],"URL":"https:\/\/doi.org\/10.1007\/s10288-021-00480-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"25 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2021","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 that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}