{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:03:19Z","timestamp":1772550199758,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10878-018-0365-8","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T09:48:10Z","timestamp":1543398490000},"page":"50-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Minmax scheduling problems with common due-date and completion time penalty"],"prefix":"10.1007","volume":"38","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":[[2018,11,28]]},"reference":[{"key":"365_CR1","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:885\u2013892","journal-title":"Optim Lett"},{"key":"365_CR2","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"},{"key":"365_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22\u201336","journal-title":"Oper Res"},{"key":"365_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173\u2013178","journal-title":"Eur J Oper Res"},{"key":"365_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/03052159908941376","volume":"31","author":"D Biskup","year":"1999","unstructured":"Biskup D, Cheng TCE (1999a) Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Eng Optim 31:329\u2013336","journal-title":"Eng Optim"},{"key":"365_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0305-0548(98)00044-6","volume":"26","author":"D Biskup","year":"1999","unstructured":"Biskup D, Cheng TCE (1999b) Multiple-machine scheduling with earliness, tardiness and completion time penalties. Comput Oper Res 26:45\u201357","journal-title":"Comput Oper Res"},{"key":"365_CR7","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1016\/j.cor.2010.06.004","volume":"39","author":"A Dolgui","year":"2012","unstructured":"Dolgui A, Gordon VS, Strusevich VA (2012) Single machine scheduling with precedence constraints and positionally dependent processing times. Comput Oper Res 39:1218\u20131224","journal-title":"Comput Oper Res"},{"key":"365_CR8","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.ipl.2012.06.009","volume":"112","author":"E Gerstl","year":"2012","unstructured":"Gerstl E, Mosheiov G (2012) Scheduling on parallel identical machines with job-rejection and position-dependent processing times. Inf Process Lett 112:743\u2013747","journal-title":"Inf Process Lett"},{"key":"365_CR9","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"},{"issue":"1","key":"365_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2008.07.044","volume":"198","author":"VS Gordon","year":"2009","unstructured":"Gordon VS, Strusevich VA (2009) Single machine scheduling and due date assignment with positionally dependent processing times. Eur J Oper Res 198(1):57\u201362","journal-title":"Eur J Oper Res"},{"issue":"1","key":"365_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"VS Gordon","year":"2002","unstructured":"Gordon VS, Proth J-M, 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):1\u201325","journal-title":"Eur J Oper Res"},{"issue":"2","key":"365_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ejor.2014.09.043","volume":"242","author":"A Janiak","year":"2015","unstructured":"Janiak A, Janiak WA, Krysial T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur J Oper Res 242(2):347\u2013357","journal-title":"Eur J Oper Res"},{"issue":"9","key":"365_CR13","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"SD Liman","year":"1998","unstructured":"Liman SD, Panwalkar SS, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49(9):1007\u20131010","journal-title":"J Oper Res Soc"},{"issue":"4","key":"365_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1057\/s41274-017-0253-0","volume":"69","author":"B Mor","year":"2018","unstructured":"Mor B (2018a) Minmax common due-window assignment and scheduling on a single machine with two competing agents. J Oper Res Soc 69(4):589\u2013602","journal-title":"J Oper Res Soc"},{"key":"365_CR15","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2018.1519557","author":"B Mor","year":"2018","unstructured":"Mor B (2018b) Single machine minmax common due-window assignment and scheduling problems with convex resource allocation. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2018.1519557","journal-title":"Eng Optim"},{"issue":"4","key":"365_CR16","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 (2012a) 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":"9","key":"365_CR17","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 (2012b) Minmax scheduling problems with common flow-allowance. J Oper Res Soc 63(9):1284\u20131293","journal-title":"J Oper Res Soc"},{"key":"365_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cor.2014.11.016","volume":"57","author":"B Mor","year":"2015","unstructured":"Mor B, Mosheiov G (2015) Scheduling a deteriorating maintenance activity and due-window assignment. Comput Oper Res 57:33\u201340","journal-title":"Comput Oper Res"},{"key":"365_CR19","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1057\/s41274-016-0003-8","volume":"67","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016) Minimizing maximum cost on a single machine with two competing agents and job rejection. J Oper Res Soc 67:1524\u20131531","journal-title":"J Oper Res Soc"},{"key":"365_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s1047","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. https:\/\/doi.org\/10.1007\/s1047","journal-title":"Ann Oper Res"},{"key":"365_CR21","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2018.1506540","author":"B Mor","year":"2018","unstructured":"Mor B, Shapira D (2018) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2018.1506540","journal-title":"J Oper Res Soc"},{"issue":"4","key":"365_CR22","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ipl.2010.11.016","volume":"111","author":"G Mosheiov","year":"2011","unstructured":"Mosheiov G (2011) Proportionate flowshops with general position-dependent processing times. Inf Process Lett 111(4):174\u2013177","journal-title":"Inf Process Lett"},{"key":"365_CR23","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1057\/palgrave.jors.2602439","volume":"59","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov G, Sarig A (2008) A due-window assignment problem with position-dependent processing times. J Oper Res Soc 59:997\u20131003","journal-title":"J Oper Res Soc"},{"key":"365_CR24","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1016\/j.cor.2008.06.001","volume":"36","author":"G Mosheiov","year":"2009","unstructured":"Mosheiov G, Sarig A (2009) Minmax scheduling problems with a common due-window. Comput Oper Res 36:1886\u20131892","journal-title":"Comput Oper Res"},{"issue":"2","key":"365_CR25","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"},{"key":"365_CR26","first-page":"7","volume":"30","author":"RW Schmenner","year":"1988","unstructured":"Schmenner RW (1988) The merit of making things fast. Sloan Manag Rev 30:7\u201311","journal-title":"Sloan Manag Rev"},{"issue":"1","key":"365_CR27","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ejor.2013.08.013","volume":"233","author":"D Shabtay","year":"2014","unstructured":"Shabtay D (2014) The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur J Oper Res 233(1):64\u201374","journal-title":"Eur J Oper Res"},{"key":"365_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"365_CR29","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.apm.2012.02.055","volume":"37","author":"J-B Wang","year":"2013","unstructured":"Wang J-B, Wang J-J (2013) Single-machine scheduling with precedence constraints and position-dependent processing times. Appl Math Model 37:649\u2013658","journal-title":"Appl Math Model"},{"key":"365_CR30","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.amc.2013.10.034","volume":"226","author":"P Xue","year":"2014","unstructured":"Xue P, Zhang Y, Yu X (2014) Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times. Appl Math Comput 226:415\u2013422","journal-title":"Appl Math Comput"},{"key":"365_CR31","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/206230","author":"X Zhang","year":"2015","unstructured":"Zhang X, Xie Q (2015) Single machine group scheduling with position dependent processing times and ready times. Math Probl Eng. https:\/\/doi.org\/10.1155\/2015\/206230","journal-title":"Math Probl Eng"},{"key":"365_CR32","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Combin Optim 33:934\u2013944","journal-title":"J Combin Optim"},{"issue":"12","key":"365_CR33","doi-asserted-by":"publisher","first-page":"3475","DOI":"10.1080\/00207543.2015.1067379","volume":"45","author":"H Zhu","year":"2016","unstructured":"Zhu H, Li M, Zhoua Z, You Y (2016) Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity maintenance activity. Int J Prod Res 45(12):3475\u20133490","journal-title":"Int J Prod Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0365-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0365-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0365-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:54:44Z","timestamp":1662512084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0365-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["365"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0365-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"28 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}