{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:55:27Z","timestamp":1774950927847,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:00:00Z","timestamp":1619654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:00:00Z","timestamp":1619654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10878-021-00746-w","type":"journal-article","created":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T12:05:29Z","timestamp":1619697929000},"page":"79-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,29]]},"reference":[{"issue":"10","key":"746_CR1","doi-asserted-by":"publisher","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(10):1280\u20131285","journal-title":"J Oper Res Soc"},{"issue":"4","key":"746_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11590-016-1059-8","volume":"11","author":"A Agnetis","year":"2017","unstructured":"Agnetis A, Mosheiov G (2017) Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim Lett 11(4):885\u2013892","journal-title":"Optim Lett"},{"key":"746_CR3","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1007\/978-3-642-41880-8"},{"issue":"10","key":"746_CR4","first-page":"1","volume":"5","author":"B Cheng","year":"2018","unstructured":"Cheng B, Cheng L (2018) Single machine slack due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. Open Access Library J 5(10):1\u20139","journal-title":"Open Access Library J"},{"issue":"6","key":"746_CR5","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1080\/00207543.2017.1371353","volume":"56","author":"F Gao","year":"2018","unstructured":"Gao F, Liu M, Wang JJ, Lu YY (2018) No-wait two-machine permutation flow shop scheduling problem with learning effect, common due date and controllable job processing times. Int J Prod Res 56(6):2361\u20132369","journal-title":"Int J Prod Res"},{"key":"746_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin"},{"issue":"8","key":"746_CR7","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1080\/0305215X.2018.1521397","volume":"51","author":"XN Geng","year":"2019","unstructured":"Geng XN, Wang JB, Bai D (2019) Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng Optim 51(8):1301\u20131323","journal-title":"Eng Optim"},{"key":"746_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2017.02.010","volume":"83","author":"E Gerstl","year":"2017","unstructured":"Gerstl E, Mor B, Mosheiov G (2017) Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection. Comput Oper Res 83:150\u2013156","journal-title":"Comput Oper Res"},{"key":"746_CR9","doi-asserted-by":"publisher","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, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"6","key":"746_CR10","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1080\/00207543.2018.1497312","volume":"57","author":"M Ji","year":"2019","unstructured":"Ji M, Zhang W, Liao L, Cheng TCE, Tan Y (2019) Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment. Int J Prod Res 57(6):1667\u20131684","journal-title":"Int J Prod Res"},{"issue":"9","key":"746_CR101","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S0305-0548(03)00103-5","volume":"31","author":"M Kaspi","year":"2004","unstructured":"Kaspi M, Shabtay D (2004) Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput Oper Res 31(9):1481\u20131489","journal-title":"Comput Oper Res"},{"issue":"1","key":"746_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/0305215X.2019.1580705","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu W, Jiang C (2020) Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng Optim 52(1):74\u201389","journal-title":"Eng Optim"},{"issue":"4","key":"746_CR12","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1080\/00207543.2015.1056323","volume":"54","author":"L Liu","year":"2016","unstructured":"Liu L, Wang JJ, Wang XY (2016) Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost. Int J Prod Res 54(4):1186\u20131195","journal-title":"Int J Prod Res"},{"key":"746_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2017.01.002","volume":"43","author":"L Liu","year":"2017","unstructured":"Liu L, Wang JJ, Liu F, Liu M (2017) Single machine due window assignment and resource allocation scheduling problems with learning and general positional effects. J Manuf Syst 43:1\u201314","journal-title":"J Manuf Syst"},{"issue":"4","key":"746_CR14","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/0305215X.2019.1608980","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu W, Yao Y, Jiang C (2020) Single-machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights. Eng Optim 52(4):701\u2013714","journal-title":"Eng Optim"},{"issue":"10","key":"746_CR15","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1080\/0305215X.2017.1414207","volume":"50","author":"YY Lu","year":"2018","unstructured":"Lu YY, Liu JY (2018) A note on resource allocation scheduling with position-dependent workloads. Eng Optim 50(10):1810\u20131827","journal-title":"Eng Optim"},{"key":"746_CR16","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-017-0253-0","author":"B Mor","year":"2017","unstructured":"Mor B (2017) Minmax common due-window assignment and scheduling on a single machine with two competing agents. J Oper Res Soc. https:\/\/doi.org\/10.1057\/s41274-017-0253-0","journal-title":"J Oper Res Soc"},{"issue":"1","key":"746_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-018-0365-8","volume":"38","author":"B Mor","year":"2019","unstructured":"Mor B (2019a) Minmax scheduling problems with common due-date and completion time penalty. J Combin Optim 38(1):50\u201371","journal-title":"J Combin Optim"},{"issue":"7","key":"746_CR18","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1080\/0305215X.2018.1519557","volume":"51","author":"B Mor","year":"2019","unstructured":"Mor B (2019b) Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation. Eng Optim 51(7):1251\u20131267","journal-title":"Eng Optim"},{"issue":"2","key":"746_CR19","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s42452-020-1946-6","volume":"2","author":"B Mor","year":"2020","unstructured":"Mor B (2020) A unified approach for single machine scheduling with position-dependent workloads and positional penalties. SN Appl Sci 2(2):214","journal-title":"SN Appl Sci"},{"issue":"3","key":"746_CR20","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.cor.2010.08.005","volume":"38","author":"B Mor","year":"2011","unstructured":"Mor B, Mosheiov G (2011) Total absolute deviation of job completion times on uniform and unrelated machines. Comput Oper Res 38(3):660\u2013665","journal-title":"Comput Oper Res"},{"issue":"9","key":"746_CR21","doi-asserted-by":"publisher","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(9):1284\u20131293","journal-title":"J Oper Res Soc"},{"issue":"2","key":"746_CR22","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.ijpe.2012.06.004","volume":"139","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012b) Parallel machine scheduling problems with common flow-allowance. Int J Prod Econ 139(2):623\u2013633","journal-title":"Int J Prod Econ"},{"issue":"4","key":"746_CR23","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.cie.2011.12.013","volume":"62","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012c) Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times. Comput Ind Eng 62(4):908\u2013916","journal-title":"Comput Ind Eng"},{"issue":"2","key":"746_CR24","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016) Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur J Oper Res 254(2):360\u2013370","journal-title":"Eur J Oper Res"},{"issue":"4","key":"746_CR25","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1007\/s10878-016-0049-1","volume":"33","author":"B Mor","year":"2017","unstructured":"Mor B, Mosheiov G (2017) A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J Combin Optim 33(4):1454\u20131468","journal-title":"J Combin Optim"},{"issue":"2","key":"746_CR26","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s10479-018-2779-1","volume":"271","author":"B Mor","year":"2018","unstructured":"Mor B, Mosheiov G (2018) A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Ann Oper Res 271(2):1079\u20131085","journal-title":"Ann Oper Res"},{"key":"746_CR27","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G, Shapira D (2020) Flowshop scheduling with learning effect and job rejection. J Sched 23:631\u2013641. https:\/\/doi.org\/10.1007\/s10951-019-00612-y","journal-title":"J Sched"},{"key":"746_CR100","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ijpe.2015.12.014","volume":"173","author":"D Oron","year":"2016","unstructured":"Oron D (2016) Scheduling controllable processing time jobs with position-dependent workloads. Int J Prod Econ 173:153\u2013160","journal-title":"Int J Prod Econ"},{"issue":"2","key":"746_CR28","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"SS Panwalkar","year":"1982","unstructured":"Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30(2):391\u2013399","journal-title":"Oper Res"},{"issue":"1\u20132","key":"746_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-017-2481-8","volume":"272","author":"J Pei","year":"2019","unstructured":"Pei J, Cheng B, Liu X, Pardalos PM, Kong M (2019) Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann Oper Res 272(1\u20132):217\u2013241","journal-title":"Ann Oper Res"},{"issue":"1","key":"746_CR30","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10479-012-1098-1","volume":"196","author":"R Rudek","year":"2012","unstructured":"Rudek R (2012) Scheduling problems with position dependent job processing times: computational complexity results. Ann Oper Res 196(1):491\u2013516","journal-title":"Ann Oper Res"},{"issue":"4","key":"746_CR31","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/00207548108956667","volume":"19","author":"A Seidmann","year":"1981","unstructured":"Seidmann A, Panwalkar SS, Smith ML (1981) Optimal assignment of due-dates for a single processor scheduling problem. Int J Prod Res 19(4):393\u2013399","journal-title":"Int J Prod Res"},{"issue":"13","key":"746_CR32","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155(13):1643\u20131666","journal-title":"Discrete Appl Math"},{"issue":"1","key":"746_CR33","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10479-013-1481-6","volume":"211","author":"LH Sun","year":"2013","unstructured":"Sun LH, Cui K, Chen JH, Wang J, He XC (2013) Research on permutation flow shop scheduling problems with general position-dependent learning effects. Ann Oper Res 211(1):473\u2013480","journal-title":"Ann Oper Res"},{"issue":"12","key":"746_CR34","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1080\/00207543.2015.1083628","volume":"54","author":"LH Sun","year":"2016","unstructured":"Sun LH, Cui K, Chen JH, Wang J (2016) Due date assignment and convex resource allocation scheduling with variable job processing times. Int J Prod Res 54(12):3551\u20133560","journal-title":"Int J Prod Res"},{"issue":"6","key":"746_CR35","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1080\/00207543.2018.1510559","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun X, Geng XN, Wang JB, Liu F (2019) Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect. Int J Prod Res 57(6):1873\u20131891","journal-title":"Int J Prod Res"},{"issue":"4","key":"746_CR36","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1080\/00207543.2015.1056317","volume":"54","author":"DJ Wang","year":"2016","unstructured":"Wang DJ, Yin Y, Cheng SR, Cheng TCE, Wu CC (2016) Due date assignment and scheduling on a single machine with two competing agents. Int J Prod Res 54(4):1152\u20131169","journal-title":"Int J Prod Res"},{"issue":"1","key":"746_CR37","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.21731","volume":"64","author":"D Wang","year":"2017","unstructured":"Wang D, Yin Y, Cheng TCE (2017) A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times. Naval Res Logist (NRL) 64(1):41\u201363","journal-title":"Naval Res Logist (NRL)"},{"issue":"3","key":"746_CR38","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1080\/00207543.2017.1346317","volume":"56","author":"X Xiong","year":"2018","unstructured":"Xiong X, Wang D, Edwin Cheng TC, Wu CC, Yin Y (2018) Single-machine scheduling and common due date assignment with potential machine disruption. Int J Prod Res 56(3):1345\u20131360","journal-title":"Int J Prod Res"},{"issue":"5","key":"746_CR39","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/nav.21700","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang DJ, Wu CC, Cheng TCE (2016) CON\/SLK due date assignment and scheduling on a single machine with two agents. Naval Res Logist 63(5):416\u2013429","journal-title":"Naval Res Logist"},{"key":"746_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.01.002","volume":"117","author":"X Zhang","year":"2018","unstructured":"Zhang X, Liao L, Zhang W, Cheng TCE, Tan Y, Ji M (2018) Single-machine group scheduling with new models of position-dependent processing times. Comput Ind Eng 117:1\u20135","journal-title":"Comput Ind Eng"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00746-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00746-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00746-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T08:15:03Z","timestamp":1643444103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00746-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,29]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00746-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,29]]},"assertion":[{"value":"10 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}