Abstract
In this article, we study the method of job rejection in the setting of proportionate flowshop, and focus on minimizing regular performance measures, subject to the constraint that the total rejection cost cannot exceed a given upper bound. In particular, we study total completion time, maximum tardiness, total tardiness, and total weighted number of tardy jobs. All the addressed problems are NP-hard as their single machine counterpart are known to be NP-hard. To the best of our knowledge, there are no detailed solutions in scheduling literature to the first two problems, whereas the last two problems were never addressed to date. For each problem, we provide a pseudo-polynomial dynamic programming solution algorithm, and furthermore, we enhance the reported running time of the first two problems. Our extensive numerical study validates the efficiency of the provided solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agnetis A, Mosheiov G (2017) Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim Lett 11(4):885–892
Cheng C-Y, Ying K-C, Chen H-H, Lin J-X (2018) Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities. Comput Ind Eng 117:164–170
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 (2015) Single machine scheduling problems with generalised due-dates and job-rejection. Int J Prod Res 55(11):3164–3172
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(2):159–162
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–156
Gerstl E, Mor B, Mosheiov G (2019) Scheduling on a proportionate flowshop to minimise total late work. Int J Prod Res 57(2):531–543
Graham RL, Lawler EL, Lenstra JK (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discr Math 4:287–326
Koulamas C, Panwalkar SS (2015) On the equivalence of single machine earliness/tardiness problems with job rejection. Comput Ind Eng 87:1–3
Li SS, Qian DL, Chen RX (2017) Proportionate Flow Shop Scheduling with Rejection. Asia-Pac J Oper Res 34(4):1750015
Mor B, Mosheiov G (2014) Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. J Oper Res Soc 65(1):151–157
Mor B, Mosheiov G (2015a) A note: minimizing maximum earliness on a proportionate flowshop. Inf Process Lett 115(2):253–255
Mor B, Mosheiov G (2015b) Minimizing the number of early jobs on a proportionate flowshop. J Oper Res Soc 66(9):1426–1429
Mor B, Mosheiov G (2016a) Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur J Oper Res 254(2):360–370
Mor B, Mosheiov G (2016b) Minimizing maximum cost on a single machine with two competing agents and job rejection. J Oper Res Soc 67(12):1524–1531
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(2):1079–1085
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
Mor B, Shapira D (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70(11):1997–2003
Panwalkar SS, Koulamas C (2015) Proportionate flow shop: new complexity results and models with due date assignment. Naval Res Log 62(2):98–106
Panwalkar SS, Koulamas C (2017) On the dominance of permutation schedules for some ordered and proportionate flow shop problem. Comput Ind Eng 107:105–108
Panwalkar SS, Smith ML, Koulamas C (2013) Review of the ordered and proportionate flow shop scheduling research. Naval Res Log 60(1):46–55
Pinedo ML (2016) Scheduling: theory, algorithms and systems, 5th edn. Springer, New-York
Shabtay D (2014) The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur J Oper Res 233(1):64–74
Shabtay D, Oron D (2016) Proportionate flow-shop scheduling with rejection. J Oper Res Soc 67(5):752–769
Shabtay D, Gaspar N, Yedidsion L (2012) A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J Comb Optim 23:395–424
Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3–28
Zhang L, Lu L, Yuan J (2010) Single-machine scheduling under the job rejection constraint. Theoret Comput Sci 411:1877–1882
Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Comb Optim 33:934–944
Acknowledgements
This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Hector Cancela.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Mor, B., Shapira, D. Regular scheduling measures on proportionate flowshop with job rejection. Comp. Appl. Math. 39, 107 (2020). https://doi.org/10.1007/s40314-020-1130-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-020-1130-z