{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T11:21:50Z","timestamp":1753183310252,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s11590-022-01967-6","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T16:09:04Z","timestamp":1673021344000},"page":"1915-1937","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-agent single-machine scheduling with release dates to minimize the makespan"],"prefix":"10.1007","volume":"17","author":[{"given":"Jin","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3963-1526","authenticated-orcid":false,"given":"Peihai","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,6]]},"reference":[{"key":"1967_CR1","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, J.C., Gawiejnowicz, S., Pacciarelli, D.: Multiagent scheduling\u202f: models and algorithms. Springer, Berlin (2014)"},{"issue":"2","key":"1967_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, P.B., Pacifici, P.A.: Scheduling problems with two competing agents. Operat. Res. 52(2), 229\u2013242 (2004)","journal-title":"Operat. Res."},{"issue":"2","key":"1967_CR3","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.: A competitive scheduling problem and its relevance to umts channel assignment. Networks 44(2), 132\u2013141 (2004)","journal-title":"Networks"},{"key":"1967_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. J. Sched. 6, 7\u201316 (2003)","journal-title":"J. Sched."},{"key":"1967_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00074-8","volume-title":"Scheduling in Computer and Manufacturing Systems","author":"J Blazewicz","year":"1993","unstructured":"Blazewicz, J., Ecker, K., Schmidt, G., Weglarz, J.: Scheduling in Computer and Manufacturing Systems. Springer, Berlin (1993)"},{"issue":"1","key":"1967_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"T Cheng","year":"2006","unstructured":"Cheng, T., Ng, C., Yuan, J.: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor Comput. Sci. 362(1), 273\u2013281 (2006)","journal-title":"Theor Comput. Sci."},{"issue":"2","key":"1967_CR7","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"T Cheng","year":"2008","unstructured":"Cheng, T., Ng, C., Yuan, J.: Multi-agent scheduling on a single machine with max-form criteria. Eur J. Operat. Res. 188(2), 603\u2013609 (2008)","journal-title":"Eur J. Operat. Res."},{"key":"1967_CR8","doi-asserted-by":"crossref","unstructured":"Ding, G., Sun, S.: Single-machine scheduling problems with two agents competing for makespan. In: Li K., Fei M., Jia L., Irwin G.W. (eds) Life System Modeling and Intelligent Computing. ICSEE 2010, LSMS 2010. Lecture Notes in Computer Science, vol 6328. Springer, Berlin. (2010)","DOI":"10.1007\/978-3-642-15621-2_28"},{"key":"1967_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-012-1099-0","volume":"213","author":"D Elvikis","year":"2014","unstructured":"Elvikis, D., T\u2019Kindt, V.: Two-agent scheduling on uniform parallel machines with min-max criteria. Annal. Operat. Res. 213, 79\u201394 (2014)","journal-title":"Annal. Operat. Res."},{"issue":"2","key":"1967_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ejor.2016.01.009","volume":"252","author":"B Fan","year":"2016","unstructured":"Fan, B., Cheng, T.: Two-agent scheduling in a flowshop. Eur. J. Operat. Res. 252(2), 376\u2013384 (2016)","journal-title":"Eur. J. Operat. Res."},{"issue":"1","key":"1967_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s40305-019-00258-9","volume":"8","author":"Q Feng","year":"2020","unstructured":"Feng, Q., Shang, W.P., Jiao, C.W., Li, W.J.: Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives. J. Operat. Res. Soc. China 8(1), 189\u2013196 (2020)","journal-title":"J. Operat. Res. Soc. China"},{"key":"1967_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11590-020-01576-1","volume":"15","author":"Y Gao","year":"2021","unstructured":"Gao, Y., Yuan, J., Ng, C.T., Cheng, T.: A note on competing-agent pareto-scheduling. Optim. Lett. 15, 249\u2013262 (2021)","journal-title":"Optim. Lett."},{"issue":"1","key":"1967_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.cor.2012.05.019","volume":"40","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., Mosheiov, G.: Scheduling problems with two competing agents to minimized weighted earliness-tardiness. Comput. Operat. Res. 40(1), 109\u2013116 (2013)","journal-title":"Comput. Operat. Res."},{"issue":"1","key":"1967_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/nav.21562","volume":"61","author":"E Gerstl","year":"2014","unstructured":"Gerstl, E., Mosheiov, G.: Single machine just-in-time scheduling problems with two competing agents. Naval Res. Logist. 61(1), 1\u201316 (2014)","journal-title":"Naval Res. Logist."},{"key":"1967_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.: Fast approximation algorithms for the knapsack and sum of subsets problems. J. ACM 22, 463\u2013468 (1975)","journal-title":"J. ACM"},{"key":"1967_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10878-007-9102-4","volume":"17","author":"I Kacem","year":"2009","unstructured":"Kacem, I.: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Combinat. Opt. 17, 117\u2013133 (2009)","journal-title":"J. Combinat. Opt."},{"key":"1967_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10951-014-0410-0","volume":"18","author":"M Kovalyov","year":"2015","unstructured":"Kovalyov, M., Oulamara, A., Soukhal, A.: Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J. Schedul. 18, 423\u2013434 (2015)","journal-title":"J. Schedul."},{"key":"1967_CR18","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manage. Sci. 19, 544\u2013546 (1973)","journal-title":"Manage. Sci."},{"issue":"16","key":"1967_CR19","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/j.ipl.2009.04.018","volume":"109","author":"K Lee","year":"2009","unstructured":"Lee, K., Choi, B.C., Leung, J.Y.T., Pinedo, M.: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inform. Process. Lett. 109(16), 913\u2013917 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"1967_CR20","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung, J.Y.T., Pinedo, M., Wan, G.: Competitive two-agent scheduling and its applications. Operat. Res. 58(2), 458\u2013469 (2010)","journal-title":"Operat. Res."},{"key":"1967_CR21","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.: Two-agent scheduling on a single machine with release dates. Comput. Operat. Res. 111, 35\u201342 (2019)","journal-title":"Comput. Operat. Res."},{"issue":"3","key":"1967_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10878-011-9378-2","volume":"24","author":"W Luo","year":"2012","unstructured":"Luo, W., Chen, L., Zhang, G.: Approximation schemes for two-machine flow shop scheduling with two agents. J. Combinat. Optim. 24(3), 229\u2013239 (2012)","journal-title":"J. Combinat. Optim."},{"key":"1967_CR23","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1007\/s10878-016-0049-1","volume":"33","author":"B Mor","year":"2017","unstructured":"Mor, B., Mosheiov, G.: A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J. Combinat. Optim. 33, 1454\u20131468 (2017)","journal-title":"J. Combinat. Optim."},{"issue":"1","key":"1967_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2011.05.041","volume":"215","author":"Q Nong","year":"2011","unstructured":"Nong, Q., Cheng, T., Ng, C.: Two-agent scheduling to minimize the total cost. Eur. J. Operat. Res. 215(1), 39\u201344 (2011)","journal-title":"Eur. J. Operat. Res."},{"key":"1967_CR25","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, J.M.: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. Eur. J. Operat. Res. 235, 1\u201316 (2014)","journal-title":"Eur. J. Operat. Res."},{"key":"1967_CR26","unstructured":"T\u2019kindt, V., Billaut, J.C.: Multicriteria Scheduling: theory, models and algorithms. Springer, Berlin (2006)"},{"key":"1967_CR27","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G Wan","year":"2010","unstructured":"Wan, G., Vakati, S.R., Leung, J.Y.T., Pinedo, M.: Scheduling two agents with controllable processing times. Eur. J. Operat. Res. 205, 528\u2013539 (2010)","journal-title":"Eur. J. Operat. Res."},{"key":"1967_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"G Woeginger","year":"2000","unstructured":"Woeginger, G.: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (fptas)? INFORMS J. Comput. 12, 57\u201374 (2000)","journal-title":"INFORMS J. Comput."},{"key":"1967_CR29","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.disopt.2005.06.005","volume":"2","author":"G Woeginger","year":"2005","unstructured":"Woeginger, G.: A comment on scheduling two machines with capacity constraints. Discrete Optim. 2, 269\u2013272 (2005)","journal-title":"Discrete Optim."},{"issue":"3","key":"1967_CR30","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s10878-016-0017-9","volume":"33","author":"X Zhang","year":"2017","unstructured":"Zhang, X., Wang, Y.: Two-agent scheduling problems on a single-machine to minimize the total weighted late work. J. Combinat. Optim. 33(3), 945\u2013955 (2017)","journal-title":"J. Combinat. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01967-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01967-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01967-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:20:57Z","timestamp":1695198057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01967-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,6]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1967"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01967-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,1,6]]},"assertion":[{"value":"13 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}