{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:47:26Z","timestamp":1767980846763,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T00:00:00Z","timestamp":1590105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T00:00:00Z","timestamp":1590105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10951-020-00656-5","type":"journal-article","created":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T19:02:37Z","timestamp":1590174157000},"page":"609-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Serial-batching scheduling with two agents to minimize makespan and maximum cost"],"prefix":"10.1007","volume":"23","author":[{"given":"Cheng","family":"He","sequence":"first","affiliation":[]},{"given":"Chunqi","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,22]]},"reference":[{"key":"656_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":"656_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"656_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150, 3\u201315.","journal-title":"Annals of Operations Research"},{"key":"656_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. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"656_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273\u2013281.","journal-title":"Theoretical Computer Science"},{"key":"656_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188, 603\u2013609.","journal-title":"European Journal of Operational Research"},{"key":"656_CR7","unstructured":"Feng, Q., Yu, Z. Y., & Shang, W. P. (2011). Pareto optimization of serial-batching scheduling problems on two agents, ICAMechS, ISBN 978-1-4577-1698-0."},{"issue":"1","key":"656_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.amc.2018.03.001","volume":"332","author":"ZC Geng","year":"2018","unstructured":"Geng, Z. C., Yuan, J. J., & Yuan, J. L. (2018). Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Applied Mathematics and Computation, 332(1), 1\u201318.","journal-title":"Applied Mathematics and Computation"},{"key":"656_CR9","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., & Kan, A. H. G. Rinnooy. (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":"656_CR10","first-page":"369","volume":"33","author":"C He","year":"2008","unstructured":"He, C., Lin, Y. X., & Yuan, J. J. (2008). Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine. Foundations of Computing and Decision Sciences, 33, 369\u2013376.","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"656_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10951-014-0410-0","volume":"18","author":"MY Kovalyov","year":"2015","unstructured":"Kovalyov, M. Y., Oulamara, A., & Soukhal, A. (2015). Two-agent scheduling with agent specific batches on an unbounded serial batching machine. Journal of Scheduling, 18, 423\u2013434.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"656_CR12","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s10878-015-9902-x","volume":"32","author":"SS Li","year":"2016","unstructured":"Li, S. S., Chen, R. X., & Feng, Q. (2016). Scheduling two job families on a single machine with two competitive agents. Journal of Combinatorial Optimization, 32(3), 784\u2013799.","journal-title":"Journal of Combinatorial Optimization"},{"key":"656_CR13","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1002\/nav.21779","volume":"64","author":"SS Li","year":"2017","unstructured":"Li, S. S., Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2017). Two-agent scheduling on a single sequential and compatible batching machine. Naval Research Logistics, 64, 628\u2013641.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"656_CR14","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215(3), 524\u2013531.","journal-title":"European Journal of Operational Research"},{"key":"656_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cie.2015.01.002","volume":"81","author":"YQ Yin","year":"2015","unstructured":"Yin, Y. Q., Cheng, T. C. E., Wan, L., Wu, C.-C., & Liu, J. (2015). Two-agent single-machine scheduling with deteriorating jobs. Computers & Industrial Engineering, 81, 177\u2013185.","journal-title":"Computers & Industrial Engineering"},{"key":"656_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2839-6","author":"YQ Yin","year":"2018","unstructured":"Yin, Y. Q., Li, D. D., Wang, D. J., & Cheng, T. C. E. (2018a). Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Annals of Operations Research,. https:\/\/doi.org\/10.1007\/s10479-018-2839-6.","journal-title":"Annals of Operations Research"},{"key":"656_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"YQ Yin","year":"2016","unstructured":"Yin, Y. Q., Wang, Y., Cheng, T. C. E., Wang, D. J., & Wu, C.-C. (2016). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering, 92, 16\u201330.","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"656_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/nav.21813","volume":"65","author":"YQ Yin","year":"2018","unstructured":"Yin, Y. Q., Yang, Y. J., Wang, D. J., Cheng, T. C. E., & Wu, C.-C. (2018b). Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Research Logistics, 65(5), 393\u2013409.","journal-title":"Naval Research Logistics"},{"key":"656_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s40305-016-0124-4","volume":"4","author":"JJ Yuan","year":"2016","unstructured":"Yuan, J. J. (2016). Complexities of some problems on multi-agent scheduling on a single machine. Journal of Operations Research Society of China, 4, 379\u2013384.","journal-title":"Journal of Operations Research Society of China"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00656-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-020-00656-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00656-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T23:06:35Z","timestamp":1621638395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-020-00656-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,22]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["656"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00656-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,22]]},"assertion":[{"value":"22 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}