{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:04:40Z","timestamp":1777597480799,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"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,8]]},"DOI":"10.1007\/s10878-022-00845-2","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T12:07:10Z","timestamp":1642680430000},"page":"480-497","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Single machine scheduling with non-availability interval and optional job rejection"],"prefix":"10.1007","volume":"44","author":[{"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"issue":"7","key":"845_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I Adiri","year":"1989","unstructured":"Adiri I, Bruno JL, Frostig E, Kan AHGR (1989) Single machine flow-time scheduling with a single breakdown. Acta Inf 26(7):679\u2013696. https:\/\/doi.org\/10.1007\/BF00288977","journal-title":"Acta Inf"},{"issue":"2","key":"845_CR2","doi-asserted-by":"publisher","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(2):229\u2013242","journal-title":"Oper Res"},{"key":"845_CR3","doi-asserted-by":"crossref","unstructured":"Alhadi G, Kacem I, Laroche P, Osman IM (2018) Maximum lateness minimization on two-parallel machine with a non-availability interval. In: 2018 5th international conference on control decision and information technologies (CoDIT), IEEE, pp 757\u2013762","DOI":"10.1109\/CoDIT.2018.8394831"},{"key":"845_CR4","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":"845_CR5","first-page":"1","volume":"59","author":"E Gerstl","year":"2020","unstructured":"Gerstl E, Mosheiov G (2020) The single machine con problem with unavailability period. Int J Prod Res 59:1\u201315","journal-title":"Int J Prod Res"},{"issue":"2","key":"845_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1051\/ro\/2017040","volume":"52","author":"W Huang","year":"2018","unstructured":"Huang W, Wu CC, Liu S (2018) Single-machine batch scheduling problem with job rejection and resource dependent processing times. RAIRO-Oper Res 52(2):315\u2013334","journal-title":"RAIRO-Oper Res"},{"issue":"1","key":"845_CR7","first-page":"1","volume":"12","author":"M Iranpoor","year":"2019","unstructured":"Iranpoor M, Fatemi Ghomi SMT (2019) Integrated due date setting and scheduling on a single machine considering an unexpected unavailability. J Optim Ind Eng 12(1):1\u201313","journal-title":"J Optim Ind Eng"},{"issue":"3","key":"845_CR8","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1016\/j.ejor.2006.06.062","volume":"187","author":"I Kacem","year":"2008","unstructured":"Kacem I, Chu C (2008) Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur J Oper Res 187(3):1080\u20131089","journal-title":"Eur J Oper Res"},{"key":"845_CR9","doi-asserted-by":"crossref","unstructured":"Kacem I, Kellerer H (2018) Improved fully polynomial approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. In: International conference on computational logistics. Springer, pp 417\u2013427","DOI":"10.1007\/978-3-030-00898-7_28"},{"issue":"4","key":"845_CR10","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H Kellerer","year":"2010","unstructured":"Kellerer H, Strusevich VA (2010) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica 57(4):769\u2013795","journal-title":"Algorithmica"},{"issue":"1","key":"845_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejor.2012.12.028","volume":"228","author":"H Kellerer","year":"2013","unstructured":"Kellerer H, Strusevich VA (2013) Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product. Eur J Oper Res 228(1):24\u201332","journal-title":"Eur J Oper Res"},{"issue":"1","key":"845_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-015-2018-y","volume":"240","author":"H Kellerer","year":"2016","unstructured":"Kellerer H, Strusevich VA (2016) Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Ann Oper Res 240(1):39\u201394","journal-title":"Ann Oper Res"},{"key":"845_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2019.02.008","volume":"147","author":"MY Kovalyov","year":"2019","unstructured":"Kovalyov MY, Mosheiov G, \u0160e\u0161ok D (2019) Comments on proportionate flowshops with general position dependent processing times[Inf. Process. Lett. 111 (2011) 174\u2013177] and minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection [Inf. Process. Lett. 132 (2018) 39\u201343]. Inf Process Lett 147:1\u20132","journal-title":"Inf Process Lett"},{"issue":"3\u20134","key":"845_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C Lee","year":"1996","unstructured":"Lee C (1996) Machine scheduling with an availability constraint. J Glob Optim 9(3\u20134):395\u2013416","journal-title":"J Glob Optim"},{"key":"845_CR15","doi-asserted-by":"publisher","unstructured":"Lee C (2004) Machine scheduling with availability constraints. In: Handbook of scheduling\u2014algorithms, models, and performance analysis. Springer. https:\/\/doi.org\/10.1201\/9780203489802.ch22","DOI":"10.1201\/9780203489802.ch22"},{"key":"845_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"JY Leung","year":"2004","unstructured":"Leung JY (2004) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton"},{"issue":"3","key":"845_CR17","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s10878-019-00429-7","volume":"38","author":"SS Li","year":"2019","unstructured":"Li SS, Chen RX, Feng Q, Jiao CW (2019) Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J Comb Optim 38(3):957\u2013971","journal-title":"J Comb Optim"},{"issue":"4","key":"845_CR18","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 (2012) 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":"11","key":"845_CR19","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":"845_CR20","first-page":"1","volume":"71","author":"B Mor","year":"2019","unstructured":"Mor B, Shapira D (2019) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc 71:1\u201311","journal-title":"J Oper Res Soc"},{"key":"845_CR21","first-page":"1","volume":"23","author":"B Mor","year":"2019","unstructured":"Mor B, Mosheiov G, Shapira D (2019) Flowshop scheduling with learning effect and job rejection. J Sched 23:1\u201311","journal-title":"J Sched"},{"key":"845_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G, Shapira D (2021) Single machine lot scheduling with optional job-rejection. J Comb Optim 41:1\u201311","journal-title":"J Comb Optim"},{"key":"845_CR23","first-page":"1","volume":"18","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 18:1\u201318","journal-title":"4OR"},{"key":"845_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ijpe.2017.12.025","volume":"198","author":"D Shabtay","year":"2018","unstructured":"Shabtay D, Zofi M (2018) Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan. Int J Prod Econ 198:191\u2013200","journal-title":"Int J Prod Econ"},{"issue":"1","key":"845_CR25","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(1):3\u201328","journal-title":"J Sched"},{"key":"845_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with time-changing effects and rate-modifying activities","author":"V Strusevich","year":"2017","unstructured":"Strusevich V, Rustogi K (2017) Scheduling with time-changing effects and rate-modifying activities. Springer, Berlin"},{"key":"845_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.03.005","volume":"445","author":"L Wan","year":"2018","unstructured":"Wan L, Yuan J (2018) Single-machine scheduling with operator non-availability to minimize total weighted completion time. Inf Sci 445:1\u20135","journal-title":"Inf Sci"},{"key":"845_CR28","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"D Wang","year":"2018","unstructured":"Wang D, Yin Y, Cheng T (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246\u2013260","journal-title":"Omega"},{"key":"845_CR29","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"G Wang","year":"2005","unstructured":"Wang G, Sun H, Chu C (2005) Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann Oper Res 133:183\u2013192","journal-title":"Ann Oper Res"},{"issue":"8","key":"845_CR30","doi-asserted-by":"publisher","first-page":"668","DOI":"10.3390\/math7080668","volume":"7","author":"L Zuo","year":"2019","unstructured":"Zuo L, Sun Z, Lu L, Zhang L (2019) Single-machine scheduling with rejection and an operator non-availability interval. Mathematics 7(8):668","journal-title":"Mathematics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00845-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00845-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00845-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:43Z","timestamp":1659079843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00845-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["845"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00845-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"assertion":[{"value":"4 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}