{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T10:59:30Z","timestamp":1790420370879,"version":"4.1.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,8]],"date-time":"2014-05-08T00:00:00Z","timestamp":1399507200000},"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,1]]},"DOI":"10.1007\/s10878-014-9744-y","type":"journal-article","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T03:47:29Z","timestamp":1399434449000},"page":"260-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan"],"prefix":"10.1007","volume":"31","author":[{"given":"Kejun","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"key":"9744_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 problem with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"9744_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":"9744_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 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":"9744_CR4","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0167-7187(96)01014-4","volume":"14","author":"PJ Brewer","year":"1996","unstructured":"Brewer PJ, Plott CR (1996) A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks. Int J Ind Organ 14:857\u2013886","journal-title":"Int J Ind Organ"},{"key":"9744_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":"9744_CR6","doi-asserted-by":"crossref","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. Eur J Oper Res 199:55\u201367","journal-title":"Eur J Oper Res"},{"key":"9744_CR7","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":"9744_CR8","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":"9744_CR9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10951-010-0201-1","volume":"14","author":"D Elvikis","year":"2010","unstructured":"Elvikis D, Hamacher HW, T\u2019kindt V (2010) Scheduling two agents on uniform parallel machines with makespan and cost functions. J Sched 14:471\u2013481","journal-title":"J Sched"},{"key":"9744_CR10","doi-asserted-by":"crossref","unstructured":"Elvikis D, T\u2019kindt V (2012) Two-agent scheduling on uniform parallel machines with min-max criteria. Ann Oper Res. doi: 10.1007\/s10479-012-1099-0","DOI":"10.1007\/s10479-012-1099-0"},{"key":"9744_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":"9744_CR12","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563\u20131581","journal-title":"Bell Syst Tech J"},{"key":"9744_CR13","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"9744_CR14","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 (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"key":"9744_CR15","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":"9744_CR16","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 M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458\u2013469","journal-title":"Oper Res"},{"key":"9744_CR17","doi-asserted-by":"crossref","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. J Comb Optim 24:229\u2013239","journal-title":"J Comb Optim"},{"key":"9744_CR18","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10951-011-0253-x","volume":"15","author":"S Li","year":"2012","unstructured":"Li S, Yuan JJ (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15:629\u2013640","journal-title":"J Sched"},{"key":"9744_CR19","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":"9744_CR20","unstructured":"Schultz DC, Oh S-H, Grecas CF, Albani M, Sanchez J, Arbib C, Arvia V, Servilio M, Del Sorbo F, Giralda A, Lombardi G (2002) A QoS concept for packet oriented S-UMTS services. In: Proceedings of the 1st Mobile Summit, Thessaloniki, Greece"},{"key":"9744_CR21","doi-asserted-by":"crossref","unstructured":"Saule E, Trystram D (2009) Multi-users scheduling in parallel systems. In: Proc. of IEEE international parallel and distributed processing symposium 2009, Washington, DC, USA, May 2009, pp 1\u20139","DOI":"10.1109\/IPDPS.2009.5161037"},{"key":"9744_CR22","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao K, Lu X (2013) Approximation schemes for two-agent scheduling on parallel machines. Theor Comput Sci 468:114\u2013121","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9744-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9744-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9744-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:23Z","timestamp":1559276603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9744-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9744"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9744-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,8]]}}}