{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:55:45Z","timestamp":1762300545314,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10479-023-05780-x","type":"journal-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T15:02:06Z","timestamp":1703084526000},"page":"275-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-agent scheduling in a two-machine open shop"],"prefix":"10.1007","volume":"333","author":[{"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7332-2201","authenticated-orcid":false,"given":"Manzhan","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"key":"5780_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., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer."},{"key":"5780_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/A:1009637419820","volume":"6","author":"A Agnetis","year":"2000","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing users. Computational & Mathematical Organization Theory, 6, 191\u2013217.","journal-title":"Computational & Mathematical Organization Theory"},{"key":"5780_CR3","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., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"5780_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0167-6377(03)00018-X","volume":"31","author":"MVD Akker","year":"2003","unstructured":"Akker, M. V. D., Hoogeven, H., & Woeginger, G. J. (2003). The two-Machine open shop problem: To fit or not to fit, that is the question. Operations Research Letters, 31, 219\u2013224.","journal-title":"Operations Research Letters"},{"key":"5780_CR5","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. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"5780_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2008.10.038","volume":"199","author":"H Balasubramanian","year":"2009","unstructured":"Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55\u201367.","journal-title":"European Journal of Operational Research"},{"key":"5780_CR7","doi-asserted-by":"publisher","first-page":"1650037","DOI":"10.1142\/S0217595916500378","volume":"33","author":"B-C Choi","year":"2016","unstructured":"Choi, B.-C., & Park, M.-J. (2016). An ordered flow shop with two agents. Asia-Pacific Journal of Operational Research, 33, 1650037.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"5780_CR8","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2017.01.010","volume":"260","author":"B-C Choi","year":"2017","unstructured":"Choi, B.-C., & Park, M. J. (2017). Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks. European Journal of Operational Research, 260(2), 514\u2013519.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5780_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10951-010-0201-1","volume":"14","author":"D Elvikis","year":"2011","unstructured":"Elvikis, D., Hamacher, H. W., & T\u2019kindt, V. (2011). Scheduling two agents on uniform parallel machines with makespan and cost functions. Journal of Scheduling, 14(5), 471\u2013481.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"5780_CR10","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. (2014). Two-agent scheduling on uniform parallel machines with min\u2013max criteria. Annals of Operations Research, 213(1), 79\u201394.","journal-title":"Annals of Operations Research"},{"key":"5780_CR11","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ejor.2016.01.009","volume":"252","author":"BQ Fan","year":"2016","unstructured":"Fan, B. Q., & Cheng, T. C. E. (2016). Two-agent scheduling in a flowshop. European Journal of Operational Research, 252, 376\u2013384.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5780_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10951-012-0274-0","volume":"16","author":"BQ Fan","year":"2012","unstructured":"Fan, B. Q., Cheng, T. C. E., Li, S. S., & Feng, Q. (2012). Bounded parallel-batching scheduling with two competing agents. Journal of Scheduling, 16(3), 261\u2013271.","journal-title":"Journal of Scheduling"},{"key":"5780_CR13","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng, Q., & Yuan, J. J. (2007). NP-hardness of a multicriteria scheduling on two families of jobs. OR Transactions, 11, 121\u2013126.","journal-title":"OR Transactions"},{"key":"5780_CR14","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. J., Ng, C. T., & Cheng, T. C. E. (2021). A note on competing-agent Pareto-scheduling. Optimization Letters, 15, 249\u2013262.","journal-title":"Optimization Letters"},{"key":"5780_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10288-021-00480-3","volume":"20","author":"Y Gao","year":"2022","unstructured":"Gao, Y., Yuan, J. J., Ng, C. T., & Cheng, T. C. E. (2022). Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR-A Quarterly Journal of Operations Research, 20, 273\u2013287.","journal-title":"4OR-A Quarterly Journal of Operations Research"},{"key":"5780_CR16","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzales","year":"1976","unstructured":"Gonzales, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23, 665\u2013679.","journal-title":"Journal of the ACM"},{"key":"5780_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnoy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"5780_CR18","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. Journal of Scheduling, 23, 609\u2013617.","journal-title":"Journal of Scheduling"},{"key":"5780_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. European Journal of Operational Research, 167, 592\u2013623.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5780_CR20","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1080\/0305215X.2017.1332762","volume":"50","author":"F Jiang","year":"2018","unstructured":"Jiang, F., Zhang, X., Bai, D., & Wu, C.-C. (2018). Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop. Engineering Optimization, 50(4), 684\u2013697.","journal-title":"Engineering Optimization"},{"issue":"4","key":"5780_CR21","doi-asserted-by":"publisher","first-page":"1750017","DOI":"10.1142\/S0217595917500178","volume":"34","author":"B-G Kim","year":"2017","unstructured":"Kim, B.-G., Choi, B.-C., & Park, M.-J. (2017). Two-machine and two-agent flow shop with special processing times structures. Asia-Pacific Journal of Operational Research, 34(4), 1750017.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"5780_CR22","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. L., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58, 458\u2013469.","journal-title":"Operations Research"},{"key":"5780_CR23","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. (2012). Approximation schemes for two-machine flow shop scheduling with two agents. Journal of Combinatorial Optimization, 24, 229\u2013239.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5780_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106163","volume":"173","author":"X Lu","year":"2022","unstructured":"Lu, X., Zhao, K., & Gu, M. (2022). Online single-machine scheduling to minimize the linear combination of makespans of two agents. Information Processing Letters, 173, 106163.","journal-title":"Information Processing Letters"},{"key":"5780_CR25","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2010.03.003","volume":"206","author":"B Mor","year":"2010","unstructured":"Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206, 540\u2013546.","journal-title":"European Journal of Operational Research"},{"key":"5780_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1057\/jors.2013.9","volume":"65","author":"B Mor","year":"2014","unstructured":"Mor, B., & Mosheiov, G. (2014). Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. Journal of the Operational Research Society, 65, 151\u2013157.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"5780_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2011.05.041","volume":"215","author":"QQ Nong","year":"2011","unstructured":"Nong, Q. Q., Cheng, T. C. E., & Ng, C. T. (2011). Two-agent scheduling to minimize the total cost. European Journal of Operational Research, 215(1), 39\u201344.","journal-title":"European Journal of Operational Research"},{"key":"5780_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems. Berlin: Springer."},{"issue":"2","key":"5780_CR29","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2017.05.019","volume":"263","author":"L Tang","year":"2017","unstructured":"Tang, L., Zhao, X., Liu, J., & Leung, J. Y. T. (2017). Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. European Journal of Operational Research., 263(2), 401\u2013411.","journal-title":"European Journal of Operational Research."},{"key":"5780_CR30","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ins.2013.06.054","volume":"251","author":"C-C Wu","year":"2013","unstructured":"Wu, C.-C., Lee, W.-C., & Liou, M.-J. (2013). Single-machine scheduling with two competing agents and learning consideration. Information Sciences, 251, 136\u2013149.","journal-title":"Information Sciences"},{"key":"5780_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Cheng, S.-R., Cheng, T. C. E., Wang, D.-J., & Wu, C.-C. (2016). Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega, 63, 41\u201347.","journal-title":"Omega"},{"key":"5780_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.cie.2014.10.025","volume":"79","author":"Y Yin","year":"2015","unstructured":"Yin, Y., Cheng, T. C. E., Yang, X., & Wu, C.-C. (2015). Two-agent single-machine scheduling with unrestricted due date assignment. Computers & Industrial Engineering, 79, 148\u2013155.","journal-title":"Computers & Industrial Engineering"},{"key":"5780_CR33","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"JJ Yuan","year":"2005","unstructured":"Yuan, J. J., Shang, W., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8, 537\u2013542.","journal-title":"Journal of Scheduling"},{"key":"5780_CR34","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. (2017). Two-agent scheduling problems on a single-machine to minimize the total weighted late work. Journal of Combinatorial Optimization, 33, 945\u2013955.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05780-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05780-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05780-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T12:24:01Z","timestamp":1707135841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05780-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,20]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5780"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05780-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2023,12,20]]},"assertion":[{"value":"4 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}