{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:12:11Z","timestamp":1726071131913},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T00:00:00Z","timestamp":1532476800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1298-y","type":"journal-article","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T09:51:37Z","timestamp":1532512297000},"page":"907-933","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An approximation algorithm for multi-agent scheduling on two uniform parallel machines"],"prefix":"10.1007","volume":"13","author":[{"given":"Manzhan","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinwei","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,25]]},"reference":[{"key":"1298_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent Scheduling-Models and Algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling-Models and Algorithms. Springer, Berlin (2014)"},{"key":"1298_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52, 229\u2013242 (2004)","journal-title":"Oper. Res."},{"key":"1298_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","volume":"12","author":"A Agnetis","year":"2009","unstructured":"Agnetis, A., Pascale, G., Pacciarelli, D.: A Lagrangian approach to single-machine scheduling problems with two competing agents. J. Sched. 12, 401\u2013415 (2009)","journal-title":"J. Sched."},{"key":"1298_CR4","doi-asserted-by":"publisher","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.: Scheduling interfering job sets on parallel machines. Eur. J. Oper. Res. 199, 55\u201367 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1298_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker, K., Smith, J.C.: A multiple criterion model for machine scheduling. J. Sched. 6, 7\u201316 (2003)","journal-title":"J. Sched."},{"key":"1298_CR6","first-page":"145","volume":"1","author":"JW Chen","year":"2017","unstructured":"Chen, J.W., Kobis, E., Kobis, M.A., Yao, J.C.: Optimality conditions for solutions of constrained inverse vector variational inequalities by means of nonlinear scalarization. J. Nonlinear Var. Anal. 1, 145\u2013158 (2017)","journal-title":"J. Nonlinear Var. Anal."},{"key":"1298_CR7","doi-asserted-by":"publisher","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.: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362, 273\u2013281 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1298_CR8","doi-asserted-by":"publisher","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.: Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188(2), 603\u2013609 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1298_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10951-010-0201-1","volume":"14","author":"D Elvikis","year":"2010","unstructured":"Elvikis, D., Hamacher, H.W., T\u2019kindt, T.: Scheduling two agents on uniform parallel machines with makespan and cost functions. J. Sched. 14, 471\u2013481 (2010)","journal-title":"J. Sched."},{"key":"1298_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O.H., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM J. Comput. 6, 155\u2013166 (1977)","journal-title":"SIAM J. Comput."},{"key":"1298_CR11","doi-asserted-by":"publisher","unstructured":"Gu, M., Gu, J., Lu, X.: An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines. J. Sched. \n                    https:\/\/doi.org\/10.1007\/s10951-017-0546-9","DOI":"10.1007\/s10951-017-0546-9"},{"key":"1298_CR12","doi-asserted-by":"publisher","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.: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf. Process. Lett. 109, 913\u2013917 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1298_CR13","doi-asserted-by":"publisher","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.: Competitive two-agent scheduling and its applications. Oper. Res. 58, 458\u2013469 (2010)","journal-title":"Oper. Res."},{"issue":"3","key":"1298_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10878-011-9378-2","volume":"24","author":"W Luo","year":"2012","unstructured":"Luo, W., Chen, L., Zhang, G.: Approximation schemes for two-machine flow shop scheduling with two agents. J. Combin. Optim. 24(3), 229\u2013239 (2012)","journal-title":"J. Combin. Optim."},{"key":"1298_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10951-015-0453-x","volume":"19","author":"I Massab\u00f2","year":"2016","unstructured":"Massab\u00f2, I., Paletta, G., Ruiz-Torres, A.J.: A note on longest processing time algoirthms for the two uniform parallel machine makespan minimization problem. J. Sched. 19, 207\u2013211 (2016)","journal-title":"J. Sched."},{"issue":"4","key":"1298_CR16","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"CT Ng","year":"2006","unstructured":"Ng, C.T., Cheng, T.C.E., Yuan, J.J.: A note on the complexity of the problem of two-agent scheduling on a single machine. J. Combin. Optim. 12(4), 387\u2013394 (2006)","journal-title":"J. Combin. Optim."},{"key":"1298_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1051\/ro\/2014005","volume":"48","author":"F Sadi","year":"2014","unstructured":"Sadi, F., Soukhal, A., Billaut, J.C.: Solving multi-agent scheduling problems on parallel machines with a global objective function. RAIAO-Oper. Res. 48, 255\u2013269 (2014)","journal-title":"RAIAO-Oper. Res."},{"key":"1298_CR18","doi-asserted-by":"crossref","unstructured":"Saule, E., Trystram, D.: Multi-users scheduling in parallel systems. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium 2009, Washington, DC, pp. 1\u20139","DOI":"10.1109\/IPDPS.2009.5161037"},{"key":"1298_CR19","unstructured":"Tung, N.L., Luu, D.V.: Optimality conditions for nonsmooth multiobjective optimization problems with general inequality constraints. J. Nonlinear Func. Anal. Article ID 2, 1\u201315 (2018)"},{"key":"1298_CR20","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G Wan","year":"2010","unstructured":"Wan, G., Vakati, R.S., Leung, J.Y.T., Pinedo, M.L.: Scheduling two agents with controllable processing times. Eur. J. Oper. Res. 205, 528\u2013539 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1298_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10951-014-0368-y","volume":"18","author":"L Wan","year":"2015","unstructured":"Wan, L., Yuan, J.J., Geng, Z.: A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. J. Sched. 18(3), 315\u2013323 (2015)","journal-title":"J. Sched."},{"key":"1298_CR22","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao, K., Lu, X.: Approximation schemes for two-agent scheduling on parallel machines. Theoret. Comput. Sci. 468, 114\u2013121 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1298_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10951-015-0460-y","volume":"19","author":"K Zhao","year":"2016","unstructured":"Zhao, K., Lu, X., Gu, M.: A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines. J. Sched. 19(1), 1\u201311 (2016)","journal-title":"J. Sched."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1298-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1298-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1298-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T23:12:30Z","timestamp":1564009950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1298-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,25]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1298"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1298-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,25]]},"assertion":[{"value":"13 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}