Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection

Baker K, Scudder G (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36 Bouzina KI, Emmons H (1996) Interval scheduling on identical machines. J Global Optim 9:379–393 Choi B, Yoon S (2007) Maximizing the weighted number of just-in-time jobs in flow shop scheduling. J Sched 10:237–243 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–172 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–43 Gerstl E, Mosheiov G (2017) Single machine scheduling problems with generalized due-dates and job-rejection. Int J Prod Res 55:3164–3172 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 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–162 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–25 Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling a survey. Ann discret math. 5:287–326 Hall NG, Posner ME (1991) Earliness–tardiness scheduling problems. I: weighted deviation of completion times about a common due date. Oper Res 39:836–846 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–848 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–334 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–431 Janiak A, Janiak W, Krysiak T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur J Oper Res 242:347–357 Koulamas C, Kyparisis GJ (2020) The no-wait flow shop with rejection. Int J Prod Res. https://doi.org/10.1080/00207543.2020.1727042 Kovalyov MY, Mosheiov G, Šešok D (2019) Comments on “Proportionate flowshops with general position dependent processing times” [Inf. Process. Lett. 111 (2011) 174–177] and “Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection” [Inf. Process. Lett. 132 (2018) 39–43]. Inf Process Lett 147:1–2 Lann A, Mosheiov G (1996) Single machine scheduling to minimize the number of early/tardy jobs. Comput Oper Res 23:769–781 Lauff V, Werner F (2004) Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey. Math Computer Modelling 40:637–655 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–1085 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. Mor B, Shapira D (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70:1997–2003 Mor B, Shapira D (2020a) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc 71:1315–1325. https://doi.org/10.1080/01605682.2019.1621222 Mor B, Shapira D (2020b) Regular scheduling measures on proportionate flowshop with job rejection. Comput Appl Math 39:1–14 Mor B, Mosheiov G, Shapira D (2020) Flowshop scheduling with learning effect and job rejection. J Sched 23:631–641. https://doi.org/10.1007/s10951-019-00612-y 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 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–527 Mosheiov G, Strusevich VA (2017) Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Nav Res Logist 64:217–224 Shabtay D, Bensoussan Y (2012) Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. J Sched 15:39–47 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–20 Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3–28 Sung SC, Vlach M (2005) Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. J Sched 8:453–460 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–63 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–47 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–335 Zhang X, Xu D, Du D, Wu C (2018) Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J Comb Optim 35:318–330 Zou J, Miao C (2016) The single machine serial batch scheduling problems with rejection. Oper Res Int J 16:211–221