Regular scheduling measures on proportionate flowshop with job rejection

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.

[1]  Dvir Shabtay,et al.  A survey on offline scheduling with rejection , 2013, J. Sched..

[2]  Christos Koulamas,et al.  On the equivalence of single machine earliness/tardiness problems with job rejection , 2015, Comput. Ind. Eng..

[3]  Gur Mosheiov,et al.  Single machine scheduling problems with generalised due-dates and job-rejection , 2017, Int. J. Prod. Res..

[4]  Christos Koulamas,et al.  Review of the ordered and proportionate flow shop scheduling research , 2013 .

[5]  Gur Mosheiov,et al.  A note: Minimizing maximum earliness on a proportionate flowshop , 2015, Inf. Process. Lett..

[6]  Gur Mosheiov,et al.  Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents , 2014, J. Oper. Res. Soc..

[7]  Gur Mosheiov,et al.  Minimizing maximum cost on a single machine with two competing agents and job rejection , 2016, J. Oper. Res. Soc..

[8]  Xueling Zhong,et al.  Scheduling with release times and rejection on two parallel machines , 2017, J. Comb. Optim..

[9]  Dvir Shabtay,et al.  A bicriteria approach to scheduling a single machine with job rejection and positional penalties , 2012, J. Comb. Optim..

[10]  Shi-Sheng Li,et al.  Proportionate Flow Shop Scheduling with Rejection , 2017, Asia Pac. J. Oper. Res..

[11]  Dana Shapira,et al.  Improved algorithms for scheduling on proportionate flowshop with job-rejection , 2019, J. Oper. Res. Soc..

[12]  Jinjiang Yuan,et al.  Single-machine scheduling under the job rejection constraint , 2010, Theor. Comput. Sci..

[13]  Chen-Yang Cheng,et al.  Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities , 2018, Comput. Ind. Eng..

[14]  Gur Mosheiov,et al.  Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance , 2016, Eur. J. Oper. Res..

[15]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[16]  Gur Mosheiov,et al.  Minimizing the number of early jobs on a proportionate flowshop , 2015, J. Oper. Res. Soc..

[17]  Gur Mosheiov,et al.  Scheduling on a proportionate flowshop to minimise total late work , 2019, Int. J. Prod. Res..

[18]  Christos Koulamas,et al.  On the dominance of permutation schedules for some ordered and proportionate flow shop problems , 2017, Comput. Ind. Eng..

[19]  Gur Mosheiov,et al.  Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection , 2017, Comput. Oper. Res..

[20]  Christos Koulamas,et al.  Proportionate flow shop: New complexity results and models with due date assignment , 2015 .

[21]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[22]  Dvir Shabtay,et al.  The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost , 2014, Eur. J. Oper. Res..

[23]  Gur Mosheiov,et al.  A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection , 2018, Ann. Oper. Res..

[24]  Gur Mosheiov,et al.  A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop , 2015, Inf. Process. Lett..

[25]  Dvir Shabtay,et al.  Proportionate flow-shop scheduling with rejection , 2016, J. Oper. Res. Soc..

[26]  Alessandro Agnetis,et al.  Scheduling with job-rejection and position-dependent processing times on proportionate flowshops , 2016, Optimization Letters.

[27]  Dana Shapira,et al.  Flowshop scheduling with learning effect and job rejection , 2019, Journal of Scheduling.

[28]  Gur Mosheiov,et al.  Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection , 2018, Inf. Process. Lett..