Scheduling problems with rejection to minimize the maximum flow time

This paper considers the scheduling problem with rejection on m identical parallel machines to minimize the maximum flow time. The authors show that this problem is NP-hard even when there is a single machine and all jobs have two distinct release dates. Furthermore, the authors present a dynamic programming algorithm and two approximation algorithms to solve them.

[1]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[2]  Yong He,et al.  Scheduling with machine cost and rejection , 2006, J. Comb. Optim..

[3]  Gerhard J. Woeginger,et al.  On-line scheduling of unit time jobs with rejection: minimizing the total completion time , 2002, Oper. Res. Lett..

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Rui Zhang,et al.  Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties , 2011, Oper. Res..

[6]  T. Neumann.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[7]  David R. Karger,et al.  Techniques for scheduling with rejection , 2003, J. Algorithms.

[8]  Han Hoogeveen,et al.  Preemptive scheduling with rejection , 2000, Math. Program..

[9]  Monaldo Mastrolilli.  Scheduling to Minimize Max Flow Time: Offline and Online Algorithms , 2003, FCT.

[10]  Zhigang Cao,et al.  Scheduling with Rejection and Non-Identical Job Arrivals , 2007, J. Syst. Sci. Complex..

[11]  Jinjiang Yuan,et al.  Single machine scheduling with release dates and rejection , 2009, Eur. J. Oper. Res..

[12]  C. T. Ng,et al.  Optimal algorithms for single-machine scheduling with rejection to minimize the makespan , 2011 .

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

[14]  David R. Karger,et al.  Techniques for scheduling with rejection , 1998, J. Algorithms.

[15]  Steven S. Seiden.  Preemptive multiprocessor scheduling with rejection , 2001, Theor. Comput. Sci..

[16]  Monaldo Mastrolilli.  Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms , 2004, Int. J. Found. Comput. Sci..

[17]  Gerhard J. Woeginger,et al.  On-line scheduling on a single machine: minimizing the total completion time , 1999, Acta Informatica.