{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T01:49:05Z","timestamp":1696384145497},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1016\/j.ejor.2011.06.037","type":"journal-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T00:19:37Z","timestamp":1309997977000},"page":"524-531","source":"Crossref","is-referenced-by-count":64,"title":["Single machine batch scheduling with two competing agents to minimize total flowtime"],"prefix":"10.1016","volume":"215","author":[{"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2011.06.037_b0005","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","article-title":"Scheduling problems with competing agents","volume":"52","author":"Agnetis","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2011.06.037_b0010","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","article-title":"Multi-agent single machine scheduling","volume":"150","author":"Agnetis","year":"2007","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2011.06.037_b0015","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","article-title":"A Lagrangian approach to single-machine scheduling problem with two competing agents","volume":"12","author":"Agnetis","year":"2009","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2011.06.037_b0020","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","article-title":"A survey of scheduling problems with setup times or costs","volume":"187","author":"Allahverdi","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2011.06.037_b0025","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","article-title":"A multiple criterion model for machine scheduling","volume":"6","author":"Baker","year":"2003","journal-title":"Journal of scheduling"},{"key":"10.1016\/j.ejor.2011.06.037_b0030","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","article-title":"Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs","volume":"362","author":"Cheng","year":"2006","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2011.06.037_b0035","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.J., 2007. Two-agent scheduling on a single machine with fixed jobs and preemption. Working paper, Department of Logistics, Hong Kong Polytechnic University."},{"key":"10.1016\/j.ejor.2011.06.037_b0040","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","article-title":"Multi-agent scheduling on a single machine with max-form criteria","volume":"88","author":"Cheng","year":"2008","journal-title":"European Journal of Operational Research1"},{"key":"10.1016\/j.ejor.2011.06.037_b0045","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.ipl.2009.04.018","article-title":"Approximation algorithms for multi-agent scheduling to minimize total weighted completion time","volume":"109","author":"Lee","year":"2009","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ejor.2011.06.037_b0050","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","article-title":"Competitive two-agent scheduling and its applications","volume":"58","author":"Leung","year":"2010","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2011.06.037_b0055","doi-asserted-by":"crossref","unstructured":"Liu, P., Tang, L., 2008. Two-agent scheduling with linear deteriorating jobs on single machine. In: Proceedings of the 14th Annual International Conference on Computing and Combinatorics, Dalian, China, pp. 642\u2013650.","DOI":"10.1007\/978-3-540-69733-6_63"},{"key":"10.1016\/j.ejor.2011.06.037_b0060","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s00170-009-2224-3","article-title":"Two-agent group scheduling with deteriorating jobs on a single machine","volume":"47","author":"Liu","year":"2009","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.ejor.2011.06.037_b0065","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00170-009-2259-5","article-title":"Two-agent single-machine scheduling with position-dependent processing times","volume":"48","author":"Liu","year":"2010","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.ejor.2011.06.037_b0070","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/j.ejor.2010.03.003","article-title":"Scheduling problems with two competing agents to minimize minmax and minsum earliness measures","volume":"206","author":"Mor","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2011.06.037_b0075","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1016\/j.ejor.2006.01.052","article-title":"A single machine batch scheduling problem with bounded batch size","volume":"187","author":"Mosheiov","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2011.06.037_b0080","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.orl.2004.09.007","article-title":"Minimizing flow-time on a single machine with integer batch sizes","volume":"33","author":"Mosheiov","year":"2005","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2011.06.037_b0085","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(88)90049-2","article-title":"One-pass batching algorithms for the one-machine problem","volume":"21","author":"Naddef","year":"1988","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2011.06.037_b0090","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","article-title":"A note on the complexity of the two-agent scheduling on a single machine","volume":"12","author":"Ng","year":"2006","journal-title":"Journal of Combinatorial optimization"},{"key":"10.1016\/j.ejor.2011.06.037_b0095","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(85)90011-2","article-title":"Batching in single operation manufacturing systems","volume":"4","author":"Santos","year":"1985","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2011.06.037_b0100","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","article-title":"A polynomial algorithm for a one machine batching problem","volume":"11","author":"Shallcross","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2011.06.037_b0105","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","article-title":"Scheduling two agents with controllable processing times","volume":"205","author":"Wan","year":"2010","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221711005662?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221711005662?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T16:15:09Z","timestamp":1560356109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221711005662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["S0377221711005662"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2011.06.037","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}