{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T08:02:40Z","timestamp":1767945760420,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2020MA030"],"award-info":[{"award-number":["ZR2020MA030"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10100-024-00954-9","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T01:08:57Z","timestamp":1733360937000},"page":"161-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9017-7827","authenticated-orcid":false,"given":"Shuguang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyue","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoxuan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Simic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dragan","family":"Pamucar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"issue":"2","key":"954_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 et al (2004) Scheduling problems with two competing agents. Oper Res 52(2):229\u2013242","journal-title":"Oper Res"},{"key":"954_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 et al (2014) Multiagent scheduling: models and algorithms. Springer, Berlin Heidelberg"},{"issue":"2","key":"954_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378","journal-title":"Eur J Oper Res"},{"issue":"3","key":"954_CR4","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TE et al (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032","journal-title":"Eur J Oper Res"},{"key":"954_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Cole Smith J (2003) A multiple-criterion model for machine scheduling. J Sched 6:7\u201316","journal-title":"J Sched"},{"key":"954_CR6","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms, 5th edn. Springer, Berlin Heidelberg","edition":"5"},{"key":"954_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen TH, Leiserson CE, Rivest RL et al (2022) Introduction to algorithms. MIT press, Cambridge, Massachusetts London, England"},{"key":"954_CR8","unstructured":"Feng Q, Yu Z, Shang W (2011) Pareto optimization of serial-batching scheduling problems on two agents. In: The 2011 international conference on advanced mechatronic systems, IEEE, pp 165\u2013168"},{"issue":"3","key":"954_CR9","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s10878-020-00626-9","volume":"40","author":"Z Geng","year":"2020","unstructured":"Geng Z, Liu J (2020) Single machine batch scheduling with two non-disjoint agents and splitable jobs. J Comb Optim 40(3):774\u2013795","journal-title":"J Comb Optim"},{"key":"954_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.amc.2018.03.001","volume":"332","author":"Z Geng","year":"2018","unstructured":"Geng Z, Yuan J, Yuan J (2018) Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Appl Math Comput 332:1\u201318","journal-title":"Appl Math Comput"},{"key":"954_CR11","first-page":"287","volume-title":"Annals of discrete mathematics","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Elsevier BC (ed) Annals of discrete mathematics, vol 5. Canada, pp 287\u2013326"},{"issue":"100","key":"954_CR12","first-page":"655","volume":"41","author":"C He","year":"2021","unstructured":"He C, Lin H (2021) Improved algorithms for two-agent scheduling on an unbounded serial-batching machine. Discrete Optim 41(100):655","journal-title":"Discrete Optim"},{"issue":"4","key":"954_CR13","first-page":"369","volume":"33","author":"C He","year":"2008","unstructured":"He C, Yx Lin, Jj Yuan (2008) Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine. Found Comput Decis Sci 33(4):369\u2013376","journal-title":"Found Comput Decis Sci"},{"issue":"1","key":"954_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10100-011-0220-9","volume":"21","author":"C He","year":"2013","unstructured":"He C, Lin H, Lin Y et al (2013) Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan. Central Eur J Oper Res 21(1):177\u2013186","journal-title":"Central Eur J Oper Res"},{"key":"954_CR15","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.disopt.2015.02.001","volume":"16","author":"C He","year":"2015","unstructured":"He C, Lin H, Lin Y (2015) Bounded serial-batching scheduling for minimizing maximum lateness and makespan. Discrete Optim 16:70\u201375","journal-title":"Discrete Optim"},{"key":"954_CR16","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10951-020-00656-5","volume":"23","author":"C He","year":"2020","unstructured":"He C, Xu C, Lin H (2020) Serial-batching scheduling with two agents to minimize makespan and maximum cost. J Sched 23:609\u2013617","journal-title":"J Sched"},{"issue":"6","key":"954_CR17","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1051\/ro\/2021175","volume":"55","author":"C He","year":"2021","unstructured":"He C, Li SS, Wu J (2021) Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine. RAIRO-Oper Res 55(6):3701\u20133714","journal-title":"RAIRO-Oper Res"},{"issue":"100","key":"954_CR18","first-page":"698","volume":"45","author":"C He","year":"2022","unstructured":"He C, Wu J, Lin H (2022) Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan. Discrete Optim 45(100):698","journal-title":"Discrete Optim"},{"issue":"3","key":"954_CR19","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(3):592\u2013623","journal-title":"Eur J Oper Res"},{"issue":"8","key":"954_CR20","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1002\/nav.21779","volume":"64","author":"S Li","year":"2017","unstructured":"Li S, Cheng T, Ng C et al (2017) Two-agent scheduling on a single sequential and compatible batching machine. Naval Res Logist 64(8):628\u2013641","journal-title":"Naval Res Logist"},{"issue":"4","key":"954_CR21","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.3934\/nhm.2023073","volume":"18","author":"S Li","year":"2023","unstructured":"Li S, Li M, Khan MI (2023) Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives. Netw Heterog Media 18(4):1678\u20131691","journal-title":"Netw Heterog Media"},{"issue":"1","key":"954_CR22","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):1\u201316","journal-title":"Eur J Oper Res"},{"issue":"2","key":"954_CR23","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228\u2013249","journal-title":"Eur J Oper Res"},{"key":"954_CR24","unstructured":"T\u2019kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms. Springer, Berlin Heidelberg"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00954-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-024-00954-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00954-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T06:37:42Z","timestamp":1767940662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-024-00954-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["954"],"URL":"https:\/\/doi.org\/10.1007\/s10100-024-00954-9","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,5]]},"assertion":[{"value":"24 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}