{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:55Z","timestamp":1759667455743,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["ISF 2505\/19"],"award-info":[{"award-number":["ISF 2505\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-021-00627-4","type":"journal-article","created":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T19:02:57Z","timestamp":1614625377000},"page":"2707-2719","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection"],"prefix":"10.1007","volume":"22","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":[]}],"member":"297","published-online":{"date-parts":[[2021,3,1]]},"reference":[{"key":"627_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K Baker","year":"1990","unstructured":"Baker K, Scudder G (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22\u201336","journal-title":"Oper Res"},{"key":"627_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"KI Bouzina","year":"1996","unstructured":"Bouzina KI, Emmons H (1996) Interval scheduling on identical machines. J Global Optim 9:379\u2013393","journal-title":"J Global Optim"},{"key":"627_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10951-007-0030-z","volume":"10","author":"B Choi","year":"2007","unstructured":"Choi B, Yoon S (2007) Maximizing the weighted number of just-in-time jobs in flow shop scheduling. J Sched 10:237\u2013243","journal-title":"J Sched"},{"key":"627_CR4","first-page":"158","volume":"32","author":"M Dabiri","year":"2019","unstructured":"Dabiri M, Darestani SA, Naderi B (2019) Multi-machine flow shop scheduling problems with rejection using genetic algorithm. Int J Serv Oper Manag 32:158\u2013172","journal-title":"Int J Serv Oper Manag"},{"key":"627_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":"627_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 generalized due-dates and job-rejection. Int J Prod Res 55:3164\u20133172","journal-title":"Int J Prod Res"},{"key":"627_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-020-00638-7","author":"E Gerstl","year":"2020","unstructured":"Gerstl E, Mosheiov G (2020) Maximum number of on-time jobs on a single machine with generalized due-dates. J Sched. https:\/\/doi.org\/10.1007\/s10951-020-00638-7","journal-title":"J Sched"},{"key":"627_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2014.09.004","volume":"115","author":"E Gerstl","year":"2015","unstructured":"Gerstl E, Mor B, Mosheiov G (2015) A note: maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Inf Process Lett 115:159\u2013162","journal-title":"Inf Process Lett"},{"key":"627_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon V, Proth JM, 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\u201325","journal-title":"Eur J Oper Res"},{"key":"627_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling a survey. Ann discret math. 5:287\u2013326","journal-title":"Ann discret math."},{"key":"627_CR11","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Posner ME (1991) Earliness\u2013tardiness scheduling problems. I: weighted deviation of completion times about a common due date. Oper Res 39:836\u2013846","journal-title":"Oper Res"},{"key":"627_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K Hiraishi","year":"2002","unstructured":"Hiraishi K, Levner E, Vlach M (2002) Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Comput Oper Res 29:841\u2013848","journal-title":"Comput Oper Res"},{"key":"627_CR13","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:315\u2013334","journal-title":"RAIRO-Oper Res"},{"key":"627_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10951-018-0584-y","volume":"22","author":"HC Hung","year":"2019","unstructured":"Hung HC, Lin BM, Posner ME, Wei JM (2019) Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. J Sched 22:413\u2013431","journal-title":"J Sched"},{"key":"627_CR15","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 W, 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":"627_CR16","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1727042","author":"C Koulamas","year":"2020","unstructured":"Koulamas C, Kyparisis GJ (2020) The no-wait flow shop with rejection. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2020.1727042","journal-title":"Int J Prod Res"},{"key":"627_CR17","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 \u201cProportionate flowshops with general position dependent processing times\u201d [Inf. Process. Lett. 111 (2011) 174\u2013177] and \u201cMinimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection\u201d [Inf. Process. Lett. 132 (2018) 39\u201343]. Inf Process Lett 147:1\u20132","journal-title":"Inf Process Lett"},{"key":"627_CR18","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann A, Mosheiov G (1996) Single machine scheduling to minimize the number of early\/tardy jobs. Comput Oper Res 23:769\u2013781","journal-title":"Comput Oper Res"},{"key":"627_CR19","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.mcm.2003.05.019","volume":"40","author":"V Lauff","year":"2004","unstructured":"Lauff V, Werner F (2004) Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey. Math Computer Modelling 40:637\u2013655","journal-title":"Math Computer Modelling"},{"key":"627_CR20","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":"627_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":"627_CR22","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:1997\u20132003","journal-title":"J Oper Res Soc"},{"key":"627_CR23","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1080\/01605682.2019.1621222","volume":"71","author":"B Mor","year":"2020","unstructured":"Mor B, Shapira D (2020a) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc 71:1315\u20131325. https:\/\/doi.org\/10.1080\/01605682.2019.1621222","journal-title":"J Oper Res Soc"},{"key":"627_CR24","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 (2020b) Regular scheduling measures on proportionate flowshop with job rejection. Comput Appl Math 39:1\u201314","journal-title":"Comput Appl Math"},{"key":"627_CR25","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G, Shapira D (2020) Flowshop scheduling with learning effect and job rejection. J Sched 23:631\u2013641. https:\/\/doi.org\/10.1007\/s10951-019-00612-y","journal-title":"J Sched"},{"key":"627_CR26","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":"627_CR27","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10951-013-0327-z","volume":"16","author":"G Mosheiov","year":"2013","unstructured":"Mosheiov G, Shabtay D (2013) Maximizing the weighted number of Just-In-Time jobs on a single machine with position-dependent processing times. J Sched 16:519\u2013527","journal-title":"J Sched"},{"key":"627_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/nav.21740","volume":"64","author":"G Mosheiov","year":"2017","unstructured":"Mosheiov G, Strusevich VA (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":"627_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10951-010-0204-y","volume":"15","author":"D Shabtay","year":"2012","unstructured":"Shabtay D, Bensoussan Y (2012) Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. J Sched 15:39\u201347","journal-title":"J Sched"},{"key":"627_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4614-1123-9_1","volume-title":"Just-in-time systems","author":"D Shabtay","year":"2012","unstructured":"Shabtay D, Steiner G (2012) Scheduling to maximize the number of just-in-time jobs: a survey. Just-in-time systems. Springer, New York, pp 3\u201320"},{"key":"627_CR31","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":"627_CR32","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"SC Sung","year":"2005","unstructured":"Sung SC, Vlach M (2005) Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. J Sched 8:453\u2013460","journal-title":"J Sched"},{"key":"627_CR33","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-981-15-3528-4_3","volume-title":"Rescheduling under disruptions in manufacturing systems","author":"D Wang","year":"2020","unstructured":"Wang D, Yin Y, Jin Y (2020) Parallel-Machine rescheduling with job rejection in the presence of job unavailability. Rescheduling under disruptions in manufacturing systems. Springer, Singapore, pp 35\u201363"},{"key":"627_CR34","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Cheng S-R, Cheng TCE, Wang D-J, Wu C-C (2016) Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63:41\u201347","journal-title":"Omega"},{"key":"627_CR35","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10951-017-0511-7","volume":"20","author":"Y Yin","year":"2017","unstructured":"Yin Y, Cheng TCE, Wang D-J (2017) Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. J Sched 20:313\u2013335","journal-title":"J Sched"},{"key":"627_CR36","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 Comb Optim 35:318\u2013330","journal-title":"J Comb Optim"},{"key":"627_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12351-015-0193-x","volume":"16","author":"J Zou","year":"2016","unstructured":"Zou J, Miao C (2016) The single machine serial batch scheduling problems with rejection. Oper Res Int J 16:211\u2013221","journal-title":"Oper Res Int J"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00627-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00627-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00627-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T17:38:53Z","timestamp":1659029933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00627-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["627"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00627-4","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2021,3,1]]},"assertion":[{"value":"18 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standard"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}