{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T20:21:58Z","timestamp":1768767718751,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"israel science foundation","doi-asserted-by":"publisher","award":["2505\/19"],"award-info":[{"award-number":["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":["J Sched"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10951-022-00745-7","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T19:02:33Z","timestamp":1663354953000},"page":"193-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection"],"prefix":"10.1007","volume":"26","author":[{"given":"Matan","family":"Atsmony","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,16]]},"reference":[{"key":"745_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"KI Bouzina","year":"1996","unstructured":"Bouzina, K. I., & Emmons, H. (1996). Interval scheduling on identical machines. Journal of Global Optimization, 9, 379\u2013393.","journal-title":"Journal of Global Optimization"},{"key":"745_CR2","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. Journal of Scheduling, 10, 237\u2013243.","journal-title":"Journal of Scheduling"},{"key":"745_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1504\/IJSOM.2019.097527","volume":"32","author":"M Dabiri","year":"2019","unstructured":"Dabiri, M., Darestani, S. A., & Naderi, B. (2019). Multi-machine flow shop scheduling problems with rejection using genetic algorithm. International Journal of Services and Operations Management, 32, 158\u2013172.","journal-title":"International Journal of Services and Operations Management"},{"key":"745_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. Information Processing Letters, 132, 39\u201343.","journal-title":"Information Processing Letters"},{"key":"745_CR5","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. Information Processing Letters, 115, 159\u2013162.","journal-title":"Information Processing Letters"},{"key":"745_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. International Journal of Production Research, 55, 3164\u20133172.","journal-title":"International Journal of Production Research"},{"key":"745_CR7","first-page":"11","volume":"1","author":"E Gerstl","year":"2020","unstructured":"Gerstl, E., & Mosheiov, G. (2020). Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. Journal of Scheduling, 1, 11.","journal-title":"Journal of Scheduling"},{"key":"745_CR8","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. Computers and Operations Research, 29, 841\u2013848.","journal-title":"Computers and Operations Research"},{"key":"745_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1051\/ro\/2017040","volume":"52","author":"W Huang","year":"2018","unstructured":"Huang, W., Wu, C. C., & Liu, S. (2018). Single-machine batch scheduling problem with job rejection and resource dependent processing times. RAIRO-Operations Research, 52, 315\u2013334.","journal-title":"RAIRO-Operations Research"},{"key":"745_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10951-018-0584-y","volume":"22","author":"HC Hung","year":"2019","unstructured":"Hung, H. C., Lin, B. M., Posner, M. E., & Wei, J. M. (2019). Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. Journal of Scheduling, 22, 413\u2013431.","journal-title":"Journal of Scheduling"},{"key":"745_CR11","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1080\/00207543.2020.1727042","volume":"59","author":"C Koulamas","year":"2021","unstructured":"Koulamas, C., & Kyparisis, G. J. (2021). The no-wait flow shop with rejection. International Journal of Production Research, 59, 1852\u20131859.","journal-title":"International Journal of Production Research"},{"key":"745_CR12","doi-asserted-by":"crossref","unstructured":"Kovalyov, M. Y., 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]. Information Processing Letters, 147: 1\u20132.","DOI":"10.1016\/j.ipl.2019.02.008"},{"key":"745_CR13","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. Computers and Operations Research, 23, 769\u2013781.","journal-title":"Computers and Operations Research"},{"key":"745_CR14","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. Annals of Operations Research, 271, 1079\u20131085.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"745_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10288-020-00436-z","volume":"19","author":"B Mor","year":"2020","unstructured":"Mor, B., & Mosheiov, G. (2020b). A note: Flowshop scheduling with linear deterioration and job-rejection. 4OR, 19(1), 103.","journal-title":"4OR"},{"key":"745_CR16","first-page":"13","volume":"1","author":"B Mor","year":"2021","unstructured":"Mor, B., & Mosheiov, G. (2021a). Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Operational Research, 1, 13.","journal-title":"Operational Research"},{"key":"745_CR17","first-page":"11","volume":"1","author":"B Mor","year":"2019","unstructured":"Mor, B., Mosheiov, G., & Shapira, D. (2019). Flowshop scheduling with learning effect and job rejection. Journal of Scheduling, 1, 11.","journal-title":"Journal of Scheduling"},{"key":"745_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. (2019). Improved algorithms for scheduling on proportionate flowshop with job-rejection. Journal of the Operational Research Society, 70, 1997\u20132003.","journal-title":"Journal of the Operational Research Society"},{"key":"745_CR19","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. Journal of the Operational Research Society, 71, 1315\u20131325.","journal-title":"Journal of the Operational Research Society"},{"key":"745_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. (2020b). Regular scheduling measures on proportionate flowshop with job rejection. Computational and Applied Mathematics, 39, 1\u201314.","journal-title":"Computational and Applied Mathematics"},{"key":"745_CR21","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1080\/0305215X.2020.1735380","volume":"53","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., & Pruwer, S. (2021). On the minmax common-due-date problem: Extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Engineering Optimization, 53, 408\u2013424.","journal-title":"Engineering Optimization"},{"key":"745_CR22","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. Journal of Scheduling, 16, 519\u2013527.","journal-title":"Journal of Scheduling"},{"key":"745_CR23","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. Journal of Scheduling, 15, 39\u201347.","journal-title":"Journal of Scheduling"},{"key":"745_CR24","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. Journal of Scheduling, 16, 3\u201328.","journal-title":"Journal of Scheduling"},{"key":"745_CR25","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 (pp. 3\u201320). Springer."},{"key":"745_CR26","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"SC Sung","year":"2005","unstructured":"Sung, S. C., & Vlach, M. (2005). Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling, 8, 453\u2013460.","journal-title":"Journal of Scheduling"},{"key":"745_CR27","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 (pp. 35\u201363). Springer."},{"key":"745_CR28","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, T. C. E., 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":"745_CR29","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, T. C. E., & Wang, D.-J. (2017). Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. Journal of Scheduling, 20, 313\u2013335.","journal-title":"Journal of Scheduling"},{"key":"745_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. Journal of Combinatorial Optimization, 35, 318\u2013330.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00745-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00745-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00745-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:09:14Z","timestamp":1680073754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00745-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,16]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["745"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00745-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,16]]},"assertion":[{"value":"3 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}