{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:27:24Z","timestamp":1660260444448},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T00:00:00Z","timestamp":1431993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9902-x","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T04:50:01Z","timestamp":1431924601000},"page":"784-799","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Scheduling two job families on a single machine with two competitive agents"],"prefix":"10.1007","volume":"32","author":[{"given":"Shi-Sheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren-Xia","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,19]]},"reference":[{"key":"9902_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multi-agent scheduling","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Souhal A (2014) Multi-agent scheduling. Springer, Berlin"},{"key":"9902_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150:3\u201315","journal-title":"Ann Oper Res"},{"key":"9902_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"9902_CR4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","volume":"12","author":"A Agnetis","year":"2009","unstructured":"Agnetis A, Pascale G, Pacciarelli D (2009) A Lagrangian approach to single-machine scheduling problems with two competing agents. J Sched 12:401\u2013415","journal-title":"J Sched"},{"key":"9902_CR5","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985\u20131032","journal-title":"Eur J Oper Res"},{"key":"9902_CR6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/net.20023","volume":"44","author":"C Arbib","year":"2004","unstructured":"Arbib C, Smriglio S, Servilio M (2004) A competitive scheduling problem and its relevance to UMTS channel assignment. Networks 44:132\u2013141","journal-title":"Networks"},{"key":"9902_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6:7\u201316","journal-title":"J Sched"},{"key":"9902_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J Bruno","year":"1978","unstructured":"Bruno J, Downey P (1978) Complexity of task sequencing with deadlines, setup times and changeover cost. SIAM J Comput 7:393\u2013404","journal-title":"SIAM J Comput"},{"key":"9902_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng TCE, Ng CT, Yuan JJ (2006) Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor Comput Sci 362:273\u2013281","journal-title":"Theor Comput Sci"},{"key":"9902_CR10","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng TCE, Ng CT, Yuan JJ (2008) Multi-agent scheduling on a single machine with max-form criteria. Eur J Oper Res 188:603\u2013609","journal-title":"Eur J Oper Res"},{"key":"9902_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10951-012-0274-0","volume":"16","author":"BQ Fan","year":"2013","unstructured":"Fan BQ, Cheng TCE, Li SS, Feng Q (2013) Bounded parallel-batching scheduling with two competing agents. J Sched 16:261\u2013271","journal-title":"J Sched"},{"key":"9902_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0167-6377(94)90040-X","volume":"16","author":"JB Ghosh","year":"1994","unstructured":"Ghosh JB (1994) Batch scheduling to minimize total completion time. Oper Res Lett 16:271\u2013275","journal-title":"Oper Res Lett"},{"key":"9902_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0167-6377(97)00028-X","volume":"21","author":"JB Ghosh","year":"1997","unstructured":"Ghosh JB, Gupta JND (1997) Batch scheduling to minimize maximum lateness. Oper Res Lett 21:77\u201380","journal-title":"Oper Res Lett"},{"key":"9902_CR14","first-page":"471","volume":"69","author":"H Hamers","year":"1995","unstructured":"Hamers H, Borm P, Tijs S (1995) On games corresponding to sequencing situations with ready times. Math Program 69:471\u2013483","journal-title":"Math Program"},{"key":"9902_CR15","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York"},{"key":"9902_CR16","unstructured":"Kim K, Poulon BC, Petrie CJ, Lesser VR (2000) Compensatory negotiation for agent-based project schedule coordination. CIFE working paper $$\\sharp $$ \u266f 55, Stanford University"},{"key":"9902_CR17","doi-asserted-by":"crossref","unstructured":"Kovalyov MY, Oulamara A, Soukhal A (2012) Two-agent scheduling with agent specific batches on an unbounded serial batching machine. In: The 2nd international symposium on combinatorial optimization, ISCO 7422. Lecture notes in computer science, Athens","DOI":"10.1007\/978-3-642-32147-4_38"},{"key":"9902_CR18","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler EL (1977) A \u201cpseudo-polynomial\u201d time algorithm for sequencing jobs to minimize total tardiness. Ann Discrete Math 1:331\u2013342","journal-title":"Ann Discrete Math"},{"key":"9902_CR19","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458\u2013469","journal-title":"Oper Res"},{"key":"9902_CR20","doi-asserted-by":"crossref","first-page":"4856","DOI":"10.1016\/j.tcs.2009.06.025","volume":"410","author":"SS Li","year":"2009","unstructured":"Li SS, Yuan JJ (2009) Scheduling with families of jobs and delivery coordination under job availability. Theor Comput Sci 410:4856\u20134863","journal-title":"Theor Comput Sci"},{"key":"9902_CR21","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10951-011-0253-x","volume":"15","author":"SS Li","year":"2012","unstructured":"Li SS, Yuan JJ (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15:629\u2013640","journal-title":"J Sched"},{"key":"9902_CR22","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37:798\u2013804","journal-title":"Oper Res"},{"key":"9902_CR23","doi-asserted-by":"crossref","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. Eur J Oper Res 206:540\u2013546","journal-title":"Eur J Oper Res"},{"key":"9902_CR24","doi-asserted-by":"crossref","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. Eur J Oper Res 215:524\u2013531","journal-title":"Eur J Oper Res"},{"key":"9902_CR25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"CT Ng","year":"2006","unstructured":"Ng CT, Cheng TCE, Yuan JJ (2006) A note on the complexity of the problem of two-agent scheduling on a single machine. J Comb Optim 12:387\u2013394","journal-title":"J Comb Optim"},{"key":"9902_CR26","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/0305-0548(94)00090-U","volume":"22","author":"JM Peha","year":"1995","unstructured":"Peha JM (1995) Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time. Comput Oper Res 22:1089\u20131100","journal-title":"Comput Oper Res"},{"key":"9902_CR27","doi-asserted-by":"crossref","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\u201316","journal-title":"Eur J Oper Res"},{"key":"9902_CR28","doi-asserted-by":"crossref","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:228\u2013249","journal-title":"Eur J Oper Res"},{"key":"9902_CR29","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395\u2013406","journal-title":"J Oper Res Soc"},{"key":"9902_CR30","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G Wan","year":"2010","unstructured":"Wan G, Vakati SR, Leung JYT, Pinedo M (2010) Scheduling two agents with controllable processing times. Eur J Oper Res 205:528\u2013539","journal-title":"Eur J Oper Res"},{"key":"9902_CR31","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"JJ Yuan","year":"2005","unstructured":"Yuan JJ, Shang WP, Feng Q (2005) A note on the scheduling with two families of jobs. J Sched 8:537\u2013542","journal-title":"J Sched"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9902-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9902-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9902-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T06:37:26Z","timestamp":1566715046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9902-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,19]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9902"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9902-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,19]]}}}