{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:15:22Z","timestamp":1774437322190,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T00:00:00Z","timestamp":1447372800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11371137"],"award-info":[{"award-number":["11371137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10951-015-0460-y","type":"journal-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T05:50:04Z","timestamp":1447393804000},"page":"21-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines"],"prefix":"10.1007","volume":"19","author":[{"given":"Kejun","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manzhan","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,13]]},"reference":[{"key":"460_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, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problem with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"460_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. Annals of Operations Research, 150, 3\u201315.","journal-title":"Annals of Operations Research"},{"key":"460_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. Journal of Scheduling, 12, 401\u2013415.","journal-title":"Journal of Scheduling"},{"key":"460_CR4","doi-asserted-by":"crossref","unstructured":"Agnetis, A., Billaut, J. C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling\u2014models and algorithms, Springer, Berlin. ISBN 978-3-642-41879-2.","DOI":"10.1007\/978-3-642-41880-8"},{"key":"460_CR5","doi-asserted-by":"crossref","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":"460_CR6","doi-asserted-by":"crossref","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":"460_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10951-012-0274-0","volume":"16","author":"BQ Fan","year":"2013","unstructured":"Fan, B. Q., Cheng, T. C. E., Li, S. S., & Feng, Q. (2013). Bounded parallel-batching scheduling with two competing agents. Journal of Scheduling, 16, 261\u2013271.","journal-title":"Journal of Scheduling"},{"key":"460_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"460_CR9","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, J. Y.-T., & Pinedo, M. L. (2009). Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Information Processing Letters, 109, 913\u2013917.","journal-title":"Information Processing Letters"},{"key":"460_CR10","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JY-T Leung","year":"2010","unstructured":"Leung, J. Y.-T., Pinedo, M., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58, 458\u2013469.","journal-title":"Operations Research"},{"key":"460_CR11","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, J. J. (2012). Unbounded parallel-batching scheduling with two competitive agents. Journal of Scheduling, 15, 629\u2013640.","journal-title":"Journal of Scheduling"},{"key":"460_CR12","volume-title":"Scheduling","author":"ML Pinedo","year":"2010","unstructured":"Pinedo, M. L. (2010). Scheduling (4th ed.). Berlin: Springer.","edition":"4"},{"key":"460_CR13","doi-asserted-by":"crossref","unstructured":"Saule, E., & Trystram, D. (2009). Multi-users scheduling in parallel systems. In Proceedings of IEEE International Parallel and Distributed Processing Symposium 2009, Washington, DC, 1C9.","DOI":"10.1109\/IPDPS.2009.5161037"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0460-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0460-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0460-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:52Z","timestamp":1559453992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0460-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,13]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["460"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0460-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,13]]}}}