{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T16:04:17Z","timestamp":1768579457314,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"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":[[2021,1]]},"DOI":"10.1007\/s10878-020-00651-8","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T22:03:03Z","timestamp":1602021783000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Single machine lot scheduling with optional job-rejection"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2824-8214","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"key":"651_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":"651_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.cor.2018.10.006","volume":"102","author":"R Cordone","year":"2019","unstructured":"Cordone R, Hosteins P (2019) A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput Oper Res 102:130\u2013140","journal-title":"Comput Oper Res"},{"key":"651_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s10878-012-9593-5","volume":"28","author":"L Epstein","year":"2014","unstructured":"Epstein L, Zebedat-Haider HJ (2014) Online scheduling with rejection and reordering: exact algorithms for unit size jobs. J Combin Optim 28:875\u2013892","journal-title":"J Combin Optim"},{"key":"651_CR4","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":"651_CR5","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":"651_CR6","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":"651_CR7","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":"651_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin D, Pinedo M, Shabtay D, Talmon N (2019) On the parameterized tractability of single machine scheduling with rejection. Eur J Oper Res 273:67\u201373","journal-title":"Eur J Oper Res"},{"key":"651_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"Y-T Hou","year":"2014","unstructured":"Hou Y-T, Yang D-L, Kuo W-H (2014) Lot scheduling on a single machine. Inf Process Lett 114:718\u2013722","journal-title":"Inf Process Lett"},{"key":"651_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01389-x","author":"M Kong","year":"2019","unstructured":"Kong M, Liu X, Pei J, Zhou Z, Pardalos PM (2019) Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-019-01389-x","journal-title":"Optim Lett"},{"key":"651_CR11","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, Sesok D (2019) Comments on \u201cProportionate flowshop with general position dependent processing times\u201d [Inf. Process. Lett. 111 (2011) 174-177] and \u201cMinimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection\u201d [Inf. Process. Lett. 132 (2018) 39-43]. Inf Process Lett 147:1\u20132","journal-title":"Inf Process Lett"},{"key":"651_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10878-016-9992-0","volume":"34","author":"L Lu","year":"2017","unstructured":"Lu L, Zhang L (2017) Single-machine scheduling with production and rejection costs to minimize the maximum earliness. J Combin Optim 34:331\u2013342","journal-title":"J Combin Optim"},{"key":"651_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10878-016-0083-z","volume":"34","author":"R Ma","year":"2017","unstructured":"Ma R, Yuan JJ (2017) Online scheduling to minimize the total weighted completion time plus the rejection cost. J Combin Optim 34:483\u2013503","journal-title":"J Combin Optim"},{"key":"651_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0365-8","author":"B Mor","year":"2018","unstructured":"Mor B (2018) Minmax scheduling problems with common due-date and completion time penalty. J Combin Optim. https:\/\/doi.org\/10.1007\/s10878-018-0365-8","journal-title":"J Combin Optim"},{"key":"651_CR15","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2020.1722119","author":"B Mor","year":"2020","unstructured":"Mor B (2020) Single-machine lot scheduling with variable lot processing times. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2020.1722119","journal-title":"Eng Optim"},{"key":"651_CR16","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":"651_CR17","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"},{"key":"651_CR18","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 (2019a) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70:1997\u20132003","journal-title":"J Oper Res Soc"},{"key":"651_CR19","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1621222","author":"B Mor","year":"2019","unstructured":"Mor B, Shapira D (2019b) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2019.1621222","journal-title":"J Oper Res Soc"},{"key":"651_CR20","doi-asserted-by":"publisher","first-page":"1","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. Comput Appl Math 39:1\u201314","journal-title":"Comput Appl Math"},{"key":"651_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-020-00436-z","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G (2020) A note: flowshop scheduling with linear deterioration and job-rejection. 4OR-Q J Oper Res. https:\/\/doi.org\/10.1007\/s10288-020-00436-z","journal-title":"4OR-Q J Oper Res"},{"key":"651_CR22","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":"651_CR23","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2020.1735380","author":"G Mosheiov","year":"2020","unstructured":"Mosheiov G, Pruwer S (2020) On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2020.1735380","journal-title":"Eng Optim"},{"key":"651_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. Naval Res Logist 64:217\u2013224","journal-title":"Naval Res Logist"},{"key":"651_CR25","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":"651_CR26","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":"651_CR27","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 TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246\u2013260","journal-title":"Omega"},{"key":"651_CR28","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":"651_CR29","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/s10878-015-9836-3","volume":"31","author":"L Zhang","year":"2016","unstructured":"Zhang L, Lu L, Li S (2016) New results on two-machine flow-shop scheduling with rejection. J Combin Optim 31:1493\u20131504","journal-title":"J Combin Optim"},{"key":"651_CR30","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10878-016-0044-6","volume":"35","author":"X Zhang","year":"2018","unstructured":"Zhang X, Xu D, Du D, Wu C (2018) Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J Combin Optim 35:318\u2013330","journal-title":"J Combin Optim"},{"key":"651_CR31","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2018.10.002","volume":"142","author":"E Zhang","year":"2019","unstructured":"Zhang E, Liu M, Zheng F, Xu Y (2019) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46\u201351","journal-title":"Inf Process Lett"},{"key":"651_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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00651-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00651-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00651-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T07:48:15Z","timestamp":1633506495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00651-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00651-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"18 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}