{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T21:47:55Z","timestamp":1766267275381,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T00:00:00Z","timestamp":1473984000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation (IL)","doi-asserted-by":"publisher","award":["1286\/14"],"award-info":[{"award-number":["1286\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10479-016-2310-5","type":"journal-article","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T01:54:31Z","timestamp":1473990871000},"page":"227-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling with two competing agents to minimize total weighted earliness"],"prefix":"10.1007","volume":"253","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9158-984X","authenticated-orcid":false,"given":"Enrique","family":"Gerstl","sequence":"first","affiliation":[]},{"given":"Baruch","family":"Mor","sequence":"additional","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,16]]},"reference":[{"key":"2310_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J. C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling. Berlin: Springer."},{"key":"2310_CR2","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 problems with competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"2310_CR3","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":"2310_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"2310_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0217595914500407","volume":"31","author":"SR Cheng","year":"2014","unstructured":"Cheng, S. R. (2014a). Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures. Asia-Pacific Journal of Operational Research, 31, 1\u201310.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"2310_CR6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ijpe.2014.05.004","volume":"156","author":"SR Cheng","year":"2014","unstructured":"Cheng, S. R. (2014b). Some new problems on two-agent scheduling to minimize the earliness costs. International Journal of Production Economics, 156, 24\u201330.","journal-title":"International Journal of Production Economics"},{"key":"2310_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.cor.2012.07.013","volume":"40","author":"TCE Cheng","year":"2013","unstructured":"Cheng, T. C. E., Chung, Y.-H., Liao, S.-C., & Lee, W.-C. (2013). Two-agent single-machine scheduling with release times to minimize the total weighted completion time. Computers & Operations Research, 40, 353\u2013361.","journal-title":"Computers & Operations Research"},{"key":"2310_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-012-1099-0","volume":"213","author":"E Donatas","year":"2014","unstructured":"Donatas, E., & T\u2019kindt, V. (2014). Two-agent scheduling on uniform parallel machines with min\u2013max criteria. Annals of Operations Research, 213, 79\u201394.","journal-title":"Annals of Operations Research"},{"key":"2310_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.cor.2014.06.020","volume":"52","author":"S Gawiejnowicz","year":"2014","unstructured":"Gawiejnowicz, S., & Suwalski, C. (2014). Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. Computers and Operations Research, 52, 135\u2013146.","journal-title":"Computers and Operations Research"},{"key":"2310_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cor.2012.05.019","volume":"40","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., & Mosheiov, G. (2013). Scheduling problems with two competing agents to minimized weighted earliness\u2013tardiness. Computers & Operations Research, 40, 109\u2013116.","journal-title":"Computers & Operations Research"},{"key":"2310_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.21562","volume":"61","author":"E Gerstl","year":"2014","unstructured":"Gerstl, E., & Mosheiov, G. (2014). Single machine just-in-time scheduling problems with two competing agents. Naval Research Logistics, 61, 1\u201316.","journal-title":"Naval Research Logistics"},{"key":"2310_CR12","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57, 769\u2013795.","journal-title":"Algorithmica"},{"key":"2310_CR13","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.cor.2011.09.018","volume":"39","author":"D-C Li","year":"2012","unstructured":"Li, D.-C., & Hsu, P.-H. (2012). Solving two-agent single-machine scheduling problem considering learning effect. Computers & Operations Research, 39, 1644\u20131651.","journal-title":"Computers & Operations Research"},{"key":"2310_CR14","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. European Journal of Operational Research, 206, 540\u2013546.","journal-title":"European Journal of Operational Research"},{"key":"2310_CR15","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. European Journal of Operational Research, 215, 524\u2013531.","journal-title":"European Journal of Operational Research"},{"key":"2310_CR16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","volume":"244","author":"D Oron","year":"2015","unstructured":"Oron, D., Shabtay, D., & Steiner, G. (2015). Single machine scheduling with two competing agents and equal job processing times. European Journal of Operational Research, 244, 86\u201399.","journal-title":"European Journal of Operational Research"},{"key":"2310_CR17","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, S. R., Leung, J. Y.-T., & Pinedo, M. (2010). Scheduling two agents with controllable processing times. European Journal of Operational Research, 205, 528\u2013539.","journal-title":"European Journal of Operational Research"},{"key":"2310_CR18","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.ins.2011.11.035","volume":"189","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Cheng, S. R., & Wu, C. C. (2012). Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Information Sciences, 189, 282\u2013292.","journal-title":"Information Sciences"},{"key":"2310_CR19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TSMCB.2004.842412","volume":"35","author":"W Zuobao","year":"2005","unstructured":"Zuobao, W., & Weng, M. X. (2005). Multiagent scheduling method with earliness and tardiness objectives in flexible job shops. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 35, 293\u2013301.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2310-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2310-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2310-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T11:38:20Z","timestamp":1495625900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2310-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,16]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["2310"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2310-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2016,9,16]]}}}