{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:35:52Z","timestamp":1770510952541,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"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":[[2021,3]]},"DOI":"10.1007\/s10288-020-00436-z","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T10:03:49Z","timestamp":1585562629000},"page":"103-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A note: flowshop scheduling with linear deterioration and job-rejection"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"436_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":"436_CR2","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495\u2013498","journal-title":"Oper Res"},{"key":"436_CR3","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":"436_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ejor.2006.10.043","volume":"183","author":"MB Cheng","year":"2007","unstructured":"Cheng MB, Sun SJ, He LM (2007) Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines. Eur J Oper Res 183:115\u2013124","journal-title":"Eur J Oper Res"},{"key":"436_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ipl.2015.11.012","volume":"116","author":"E Epstein","year":"2016","unstructured":"Epstein E, Zebedat-Haider H (2016) Online scheduling of unit jobs on three machines with rejection: a tight result. Inf Process Lett 116:252\u2013255","journal-title":"Inf Process Lett"},{"key":"436_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2017.12.004","volume":"132","author":"S Fiszman","year":"2018","unstructured":"Fiszman S, Mosheiov G (2018) Minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection. Inf Process Lett 132:39\u201343","journal-title":"Inf Process Lett"},{"key":"436_CR7","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"},{"key":"436_CR8","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl E, Mosheiov G (2017) Single machine scheduling problems with generalised due-dates and job-rejection. Int J Prod Res 55:3164\u20133172","journal-title":"Int J Prod Res"},{"key":"436_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"},{"key":"436_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JND Gupta","year":"1988","unstructured":"Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387\u2013393","journal-title":"Comput Ind Eng"},{"key":"436_CR11","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 JYT, Lee K, Pinedo ML (2016) Improved algorithms for single machine scheduling with release dates and rejections. 4OR 14: 41\u201355","journal-title":"4OR"},{"key":"436_CR12","first-page":"15","volume":"3","author":"A Kononov","year":"1996","unstructured":"Kononov A (1996) Combinatorial complexity of scheduling jobs with simple linear processing times. Diskretny Analiz i Issledovanie Operatsii 3:15\u201332","journal-title":"Diskretny Analiz i Issledovanie Operatsii"},{"key":"436_CR13","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1057\/palgrave.jors.2601117","volume":"52","author":"A Kononov","year":"2001","unstructured":"Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52:708\u2013717","journal-title":"J Oper Res Soc"},{"key":"436_CR14","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ipl.2013.05.006","volume":"113","author":"R Ma","year":"2013","unstructured":"Ma R, Yuan J (2013) Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Inf Process Lett 113:593\u2013598","journal-title":"Inf Process Lett"},{"key":"436_CR15","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":"436_CR16","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:1079\u20131085","journal-title":"Ann Oper Res"},{"issue":"11","key":"436_CR17","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B Mor","year":"2019","unstructured":"Mor B, Shapira D (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70(11):1997\u20132003","journal-title":"J Oper Res Soc"},{"key":"436_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-019-00612-y","author":"B Mor","year":"2019","unstructured":"Mor B, Mosheiov G, Shapira D (2019) Flowshop scheduling with learning effect and job-rejection. J Sched. https:\/\/doi.org\/10.1007\/s10951-019-00612-y","journal-title":"J Sched"},{"key":"436_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s40314-020-1130-z","volume":"39","author":"B Mor","year":"2020","unstructured":"Mor B, Shapira D (2020) Regular scheduling measures on proportionate flowshop with job rejection. Comp Appl Math 39:107. https:\/\/doi.org\/10.1007\/s40314-020-1130-z","journal-title":"Comp Appl Math"},{"key":"436_CR19","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1287\/opre.39.6.979","volume":"39","author":"G Mosheiov","year":"1991","unstructured":"Mosheiov G (1991) V-shaped policies for scheduling deteriorating jobs. Oper Res 39:979\u2013991","journal-title":"Oper Res"},{"key":"436_CR20","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","volume":"21","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653\u2013659","journal-title":"Comput Oper Res"},{"key":"436_CR21","first-page":"205","volume":"36","author":"G Mosheiov","year":"1998","unstructured":"Mosheiov G (1998) Multi-machine scheduling with linear deterioration. INFOR Inf Syst Oper Res 36:205\u2013214","journal-title":"INFOR Inf Syst Oper Res"},{"key":"436_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0166-218X(00)00385-1","volume":"117","author":"G Mosheiov","year":"2002","unstructured":"Mosheiov G (2002) Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Math 117:195\u2013209","journal-title":"Discrete Appl Math"},{"key":"436_CR23","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.ijpe.2011.09.005","volume":"135","author":"G Mosheiov","year":"2012","unstructured":"Mosheiov G (2012) A note: multi-machine scheduling with general position-based deterioration to minimize total load. Int J Prod Econ 135:523\u2013525","journal-title":"Int J Prod Econ"},{"key":"436_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/nav.21740","volume":"64","author":"G Mosheiov","year":"2017","unstructured":"Mosheiov G, Strusevich V (2017) Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Nav Res Logist 64:217\u2013224","journal-title":"Nav Res Logist"},{"key":"436_CR25","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1016\/j.cor.2010.01.006","volume":"37","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Sarig A, Sidney J (2010) The Browne\u2013Yechiali single-machine sequence is optimal for flow-shops. Comput Oper Res 37:1965\u20131967","journal-title":"Comput Oper Res"},{"key":"436_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-019-00418-w","author":"G Mosheiov","year":"2019","unstructured":"Mosheiov G, Sarig A, Strusevich V (2019) Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR. https:\/\/doi.org\/10.1007\/s10288-019-00418-w","journal-title":"4OR"},{"key":"436_CR27","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":"436_CR28","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"J Ou","year":"2016","unstructured":"Ou J, Zhong X, Li C-L (2016) Faster algorithms for single machine scheduling with release dates and rejection. Inf Process Lett 116:503\u2013507","journal-title":"Inf Process Lett"},{"key":"436_CR29","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":"436_CR30","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10951-014-0395-8","volume":"18","author":"S Thevenin","year":"2015","unstructured":"Thevenin S, Zufferey N, Widmer M (2015) Metaheuristics for a scheduling problem with rejection and tardiness penalties. J Sched 18:89\u2013105","journal-title":"J Sched"},{"key":"436_CR35","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1080\/00207543.2015.1136081","volume":"54","author":"DJ Wang","year":"2016","unstructured":"Wang DJ, Yin Y, Liu M (2016) Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. Int J Prod Res 54:3691\u20133705","journal-title":"Int J Prod Res"},{"key":"436_CR31","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":"436_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. Theor Comput Sci 411:1877\u20131882","journal-title":"Theor Comput Sci"},{"key":"436_CR33","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10288-016-0339-6","volume":"15","author":"X Zhong","year":"2017","unstructured":"Zhong X, Ou J (2017) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR 15:387\u2013406","journal-title":"4OR"},{"key":"436_CR34","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 Comb Optim 33:934\u2013944","journal-title":"J Comb Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00436-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-020-00436-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00436-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T23:48:16Z","timestamp":1617061696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-020-00436-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["436"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00436-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"29 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","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":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}