{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:58:45Z","timestamp":1772297925394,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T00:00:00Z","timestamp":1467158400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0049-1","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T13:23:03Z","timestamp":1467206583000},"page":"1454-1468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance"],"prefix":"10.1007","volume":"33","author":[{"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,29]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1057\/jors.1996.155","volume":"47","author":"GI Adamopoulos","year":"1996","unstructured":"Adamopoulos GI, Pappis CP (1996) Single machine scheduling with flow allowances. J Oper Res Soc 47:1280\u20131285","journal-title":"J Oper Res Soc"},{"key":"49_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 PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"49_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. Ann Oper Res 150:3\u201315","journal-title":"Ann Oper Res"},{"key":"49_CR4","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 JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling. Springer, Berlin"},{"key":"49_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":"49_CR6","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.cie.2010.12.008","volume":"60","author":"TCE Cheng","year":"2011","unstructured":"Cheng TCE, Cheng SR, Wu WH, Hsu PH, Wu CC (2011) A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput Ind Eng 60:534\u2013541","journal-title":"Comput Ind Eng"},{"key":"49_CR7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.cie.2014.09.028","volume":"78","author":"TCE Cheng","year":"2014","unstructured":"Cheng TCE, Liu CY, Lee WC (2014) Two-agent single-machine scheduling to minimize the weighted sum of the agents\u2019 objective function. Comput Ind Eng 78:66\u201373","journal-title":"Comput Ind Eng"},{"key":"49_CR8","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1057\/jors.2010.171","volume":"62","author":"S Gawiejnowicz","year":"2011","unstructured":"Gawiejnowicz S, Lee WC, Lin CL, Wu CC (2011) Single-machine scheduling of proportionally deteriorating jobs by two agents. J Oper Res Soc 62:1983\u20131991","journal-title":"J Oper Res Soc"},{"key":"49_CR9","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 minimize weighted earliness-tardiness. Comput Oper Res 40:109\u2013116","journal-title":"Comput Oper Res"},{"key":"49_CR10","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. Nav Res Logist 61:1\u201316","journal-title":"Nav Res Logist"},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"VS Gordon","year":"2002","unstructured":"Gordon VS, Proth JM, Chu C (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139:1\u201325","journal-title":"Eur J Oper Res"},{"key":"49_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.cie.2013.11.017","volume":"68","author":"M Ji","year":"2014","unstructured":"Ji M, Chen K, Ge J, Cheng TCE (2014) Group scheduling and job-dependent due-window assignment based on a common flow allowance. Comput Ind Eng 68:35\u201341","journal-title":"Comput Ind Eng"},{"key":"49_CR13","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458\u2013469","journal-title":"Oper Res"},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.cor.2011.09.018","volume":"39","author":"DC Li","year":"2012","unstructured":"Li DC, Hsu PH (2012) Solving a two-agent single-machine scheduling problem considering learning effect. Comput Oper Res 39:1644\u20131651","journal-title":"Comput Oper Res"},{"key":"49_CR15","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 (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15:629\u2013640","journal-title":"J Sched"},{"key":"49_CR16","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":"49_CR17","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. Eur J Oper Res 206:540\u2013546","journal-title":"Eur J Oper Res"},{"key":"49_CR18","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. Eur J Oper Res 215:524\u2013531","journal-title":"Eur J Oper Res"},{"key":"49_CR19","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1057\/jors.2011.135","volume":"63","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012a) Minmax scheduling problems with common flow-allowance. J Oper Res Soc 63:1284\u20131293","journal-title":"J Oper Res Soc"},{"key":"49_CR20","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ijpe.2011.07.013","volume":"135","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012b) Scheduling a maintenance activity and due-window assignment based on common flow allowance. Int J Prod Econ 135:222\u2013230","journal-title":"Int J Prod Econ"},{"key":"49_CR21","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.ijpe.2012.06.004","volume":"139","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012c) Parallel machine scheduling problems with common flow- allowance. Int J Prod Econ 139:623\u2013633","journal-title":"Int J Prod Econ"},{"key":"49_CR22","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/jors.2013.9","volume":"65","author":"B Mor","year":"2014","unstructured":"Mor B, Mosheiov G (2014) Polynomial time solutions for scheduling problems on proportionate flowshop with two competing agents. J Oper Res Soc 65:151\u2013157","journal-title":"J Oper Res Soc"},{"key":"49_CR23","doi-asserted-by":"publisher","unstructured":"Mor B, Mosheiov G (2016a) Minimizing maximum cost on a single machine with two competing agents and job rejection. J Oper Res Soc. doi: 10.1057\/s41274-016-0003-8","DOI":"10.1057\/s41274-016-0003-8"},{"key":"49_CR24","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016b) Minsum and minmax scheduling on a proportionate flowshop with common flow allowance. Eur J Oper Res 254:360\u2013370","journal-title":"Eur J Oper Res"},{"key":"49_CR25","first-page":"61","volume":"17","author":"G Mosheiov","year":"2007","unstructured":"Mosheiov G, Oron D (2007) Minmax scheduling with job-classes and earliness-tardiness costs. Eur J Oper Res 17:61\u201362","journal-title":"Eur J Oper Res"},{"key":"49_CR26","first-page":"185","volume":"35","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Oron D (2010) Job dependent due-window assignment based on a common flow allowance. Found Comput Decis Sci 35:185\u2013195","journal-title":"Found Comput Decis Sci"},{"key":"49_CR27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.ejor.2007.10.043","volume":"93","author":"G Mosheiov","year":"2009","unstructured":"Mosheiov G, Sarig A (2009) Due-date assignment on uniform machines. Eur J Oper Res 93:49\u201358","journal-title":"Eur J Oper Res"},{"key":"49_CR28","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 CTE, Yuan JJ (2006) A note on the complexity of the two-agent scheduling on a single machine. J Comb Optim 12:387\u2013394","journal-title":"J Comb Optim"},{"key":"49_CR29","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/msom.1060.0139","volume":"9","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manuf Serv Oper Manag 9:332\u2013350","journal-title":"Manuf Serv Oper Manag"},{"key":"49_CR30","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02896403","volume":"21","author":"JB Wang","year":"2006","unstructured":"Wang JB (2006) Single machine common flow allowance scheduling with controllable processing times. J Appl Math Comput 21:249\u2013257","journal-title":"J Appl Math Comput"},{"key":"49_CR31","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/s10878-014-9744-y","volume":"31","author":"K Zhao","year":"2016","unstructured":"Zhao K, Lu X (2016) Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan. J Comb Optim 31:260\u2013278","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0049-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0049-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0049-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0049-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T10:54:35Z","timestamp":1568112875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0049-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,29]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["49"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0049-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,29]]}}}