{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:43:01Z","timestamp":1778827381578,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T00:00:00Z","timestamp":1295395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9378-2","type":"journal-article","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T13:24:57Z","timestamp":1295357097000},"page":"229-239","source":"Crossref","is-referenced-by-count":33,"title":["Approximation schemes for two-machine flow shop scheduling with two agents"],"prefix":"10.1007","volume":"24","author":[{"given":"Wenchang","family":"Luo","sequence":"first","affiliation":[]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,19]]},"reference":[{"key":"9378_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"9378_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, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150:3\u201315","journal-title":"Ann Oper Res"},{"key":"9378_CR3","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 GD, 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":"9378_CR4","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 relevances to UMTS channel assignment. Networks 44:132\u2013141","journal-title":"Networks"},{"key":"9378_CR5","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":"9378_CR6","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":"9378_CR7","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":"9378_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"9378_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist 1:61\u201368","journal-title":"Nav Res Logist"},{"key":"9378_CR10","doi-asserted-by":"crossref","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 JY-T, Pinedo ML (2009) Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf Process Lett 109:913\u2013917","journal-title":"Inf Process Lett"},{"key":"9378_CR11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JY-T Leung","year":"2010","unstructured":"Leung JY-T, Pinedo ML, Wan G (2010) Competitive two agent scheduling and its applications. Oper Res 58:458\u2013469","journal-title":"Oper Res"},{"key":"9378_CR12","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"MA Kubzin","year":"2006","unstructured":"Kubzin MA, Strusevich VA (2006) Planning machine maintenance in two-machine shop scheduling. Oper Res 54:789\u2013800","journal-title":"Oper Res"},{"key":"9378_CR13","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":"9378_CR14","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 W, 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-011-9378-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9378-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9378-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9378-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,19]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9378"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9378-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,19]]}}}