{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:58:00Z","timestamp":1769306280888,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10288-019-00418-w","type":"journal-article","created":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T06:07:35Z","timestamp":1567145255000},"page":"439-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Minmax scheduling and due-window assignment with position-dependent processing times and job rejection"],"prefix":"10.1007","volume":"18","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"given":"Assaf","family":"Sarig","sequence":"additional","affiliation":[]},{"given":"Vitaly","family":"Strusevich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"418_CR1","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":"418_CR2","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"Z Cao","year":"2007","unstructured":"Cao Z, Zhang Y (2007) Scheduling with rejection and nonidentical job arrivals. J Syst Sci Complex 20:529\u2013535","journal-title":"J Syst Sci Complex"},{"key":"418_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11750321_8","volume":"3959","author":"Z Cao","year":"2006","unstructured":"Cao Z, Wang Z, Zhang Y, Liu S (2006) On several scheduling problems with rejection or discretely compressible processing times. Lect Notes Comput Sci 3959:90\u201398","journal-title":"Lect Notes Comput Sci"},{"key":"418_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"Y Cheng","year":"2009","unstructured":"Cheng Y, Sun S (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194:18\u201327","journal-title":"Eur J Oper Res"},{"key":"418_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1\u201313","journal-title":"Eur J Oper Res"},{"key":"418_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"11","author":"HN Gabow","year":"1988","unstructured":"Gabow HN, Tarjan RE (1988) Algorithms for two bottleneck optimization problems. J Algorithms 11:411\u2013417","journal-title":"J Algorithms"},{"key":"418_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","volume":"57","author":"S Gawiejnowicz","year":"1996","unstructured":"Gawiejnowicz S (1996) A note on a single processor with speed dependent on a number of executed jobs. Inf Process Lett 57:297\u2013300","journal-title":"Inf Process Lett"},{"key":"418_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10288-016-0303-5","volume":"14","author":"C He","year":"2016","unstructured":"He C, Leung Y-T, Lee K, Pinedo ML (2016) Improved algorithms for single machine scheduling with release dates and rejection. 4OR 14:41\u201355","journal-title":"4OR"},{"key":"418_CR9","unstructured":"Janiak A, Marek M (2004) Parallel processor scheduling problems with optimal due interval assignment. In: Proceedings of the 5th Mexican international conference in computer science (ENC\u201904). IEEE Press, Colima, pp 383\u2013387"},{"key":"418_CR10","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/TSMCA.2007.893485","volume":"37","author":"A Janiak","year":"2007","unstructured":"Janiak A, Kovalyov MY, Marek M (2007) Soft due window assignment and scheduling on parallel machines. IEEE Trans Syst Man Cybern A Syst Hum 37:614\u2013620","journal-title":"IEEE Trans Syst Man Cybern A Syst Hum"},{"key":"418_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10288-012-0201-4","volume":"10","author":"A Janiak","year":"2012","unstructured":"Janiak A, Janiak WA, Kovalyov MY, Werner F (2012) Soft due window assignment and scheduling of unit-time jobs on parallel machines. 4OR Q J Oper Res 10:347\u2013360","journal-title":"4OR Q J Oper Res"},{"key":"418_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, Krysiak T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur J Oper Res 242:347\u2013357","journal-title":"Eur J Oper Res"},{"key":"418_CR13","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-540-87744-8_50","volume":"5193","author":"S Khuller","year":"2008","unstructured":"Khuller S, Mestre J (2008) An optimal incremental algorithm for minimizing lateness with rejection. Lect Notes Comput Sci 5193:601\u2013610","journal-title":"Lect Notes Comput Sci"},{"key":"418_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L Lu","year":"2008","unstructured":"Lu L, Zhang L, Yuan J (2008) The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoret Comput Sci 396:283\u2013289","journal-title":"Theoret Comput Sci"},{"key":"418_CR15","doi-asserted-by":"publisher","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L Lu","year":"2009","unstructured":"Lu L, Cheng TCE, Yuan J, Zhang L (2009) Bounded single machine parallel-batch scheduling with release dates and rejection. Comput Oper Res 36:2748\u20132751","journal-title":"Comput Oper Res"},{"key":"418_CR16","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/S0305-0548(99)00127-6","volume":"28","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001a) A common due-date assignment problem on parallel identical machines. Comput Oper Res 28:719\u2013732","journal-title":"Comput Oper Res"},{"key":"418_CR17","first-page":"107","volume":"39","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001b) A due-window determination in minmax scheduling problems. INFOR 39:107\u2013123","journal-title":"INFOR"},{"key":"418_CR18","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ipl.2010.11.016","volume":"17","author":"G Mosheiov","year":"2011","unstructured":"Mosheiov G (2011) Proportionate flow shops with general position-dependent processing times. Inf Process Lett 17:174\u2013177","journal-title":"Inf Process Lett"},{"key":"418_CR19","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"},{"key":"418_CR20","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1016\/j.ins.2009.11.042","volume":"180","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Sarig A (2010) Scheduling with a common due-window: polynomially solvable cases. Inf Sci 180:1492\u20131505","journal-title":"Inf Sci"},{"key":"418_CR21","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou J, Zhong X, Wang G (2015) An improved heuristic for parallel machine scheduling with rejection. Eur J Oper Res 241:653\u2013661","journal-title":"Eur J Oper Res"},{"key":"418_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-80784-8_2","volume-title":"Symposium on the theory of scheduling and its applications","author":"SS Panwalkar","year":"1973","unstructured":"Panwalkar SS, Dubek RA, Smith ML (1973) Sequencing research and the industrial scheduling problem. In: Elmaghraby SE (ed) Symposium on the theory of scheduling and its applications. Springer, Berlin, pp 29\u201337"},{"key":"418_CR23","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/nav.21518","volume":"60","author":"SS Panwalkar","year":"2013","unstructured":"Panwalkar SS, Smith ML, Koulamas C (2013) Review of the ordered and proportionate flow shop scheduling research. Nav Res Logist 60:46\u201355","journal-title":"Nav Res Logist"},{"key":"418_CR24","volume-title":"Scheduling: theory, algorithms and systems","author":"ML Pinedo","year":"2017","unstructured":"Pinedo ML (2017) Scheduling: theory, algorithms and systems. Prentice-Hall, Englewood Cliffs"},{"key":"418_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume":"2748","author":"S Sengupta","year":"2003","unstructured":"Sengupta S (2003) Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. Lect Notes Comput Sci 2748:79\u201390","journal-title":"Lect Notes Comput Sci"},{"key":"418_CR26","doi-asserted-by":"publisher","first-page":"653","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:653\u2013661","journal-title":"Eur J Oper Res"},{"key":"418_CR27","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cor.2010.10.022","volume":"39","author":"D Shabtay","year":"2012","unstructured":"Shabtay D, Gaspar N (2012) Two machine flow shop scheduling with rejection. Comput Oper Res 39:64\u201374","journal-title":"Comput Oper Res"},{"key":"418_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":"418_CR29","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1016\/j.ins.2009.02.015","volume":"179","author":"Y Yin","year":"2009","unstructured":"Yin Y, Xu D, Sun K, Li H (2009) Some scheduling problems with general position-dependent and time-dependent learning effects. Inf Sci 179:2416\u20132425","journal-title":"Inf Sci"},{"key":"418_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"L Zhang","year":"2016","unstructured":"Zhang L, Lu L (2016) Parallel-machine scheduling with release dates and rejection. 4OR 14:165\u2013172","journal-title":"4OR"},{"key":"418_CR31","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang L, Lu L, Yuan J (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975\u2013978","journal-title":"Eur J Oper Res"},{"key":"418_CR32","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang L, Lu L, Yuan J (2010) Single-machine scheduling under the job rejection constraint. Theoret Comput Sci 411:1877\u20131882","journal-title":"Theoret Comput Sci"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00418-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-019-00418-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00418-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T14:09:41Z","timestamp":1608300581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-019-00418-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,30]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["418"],"URL":"https:\/\/doi.org\/10.1007\/s10288-019-00418-w","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,30]]},"assertion":[{"value":"1 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}