Scheduling on parallel identical machines with late work criterion: Offline and online cases

In the paper, we consider the problem of scheduling jobs on parallel identical machines with the late work criterion and a common due date, both offline and online cases. Since the late work criterion has not been studied in the online mode so far, the analysis of the online problem is preceded by the analysis of the offline problem, whose complexity status has not been formally stated in the literature yet. Namely, for the offline mode, we prove that the two-machine problem is binary NP-hard, and the general case is unary NP-hard. In the online mode we assume that jobs arrive in the system one by one, i.e., we consider the online over list model. We give an algorithm with a competitive ratio being a function of the number of machines, and we prove the optimality of this approach for two identical machines.

[1]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[2]  Malgorzata Sterna,et al.  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date , 2008, Comput. Oper. Res..

[3]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[4]  Gerd Finke,et al.  Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors , 1987, Inf. Process. Lett..

[5]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Weighted Late Work , 1995, INFORMS J. Comput..

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

[7]  Malgorzata Sterna,et al.  Late work minimization in a small flexible manufacturing system , 2007, Comput. Ind. Eng..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[10]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[11]  Malgorzata Sterna,et al.  Late work minimization in flow shops by a genetic algorithm , 2009, Comput. Ind. Eng..

[12]  Malgorzata Sterna,et al.  Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date , 2005, KI.

[13]  Malgorzata Sterna,et al.  Total Late Work Criteria for Shop Scheduling Problems , 2000 .

[14]  Jacek Blazewicz,et al.  A note on the two machine job shop with the weighted late work criterion , 2007, J. Sched..

[15]  Ron Shamir,et al.  Minimizing the number of tardy job units under release time constraints , 1990, Discret. Appl. Math..

[16]  Malgorzata Sterna,et al.  Dominance relations for two-machine flow shop problem with late work criterion , 2007 .

[17]  Matthias Englert,et al.  The Power of Reordering for Online Minimum Makespan Scheduling , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..

[19]  Ning Ding,et al.  Online Minimum makespan Scheduling with a Buffer , 2012, Int. J. Found. Comput. Sci..

[20]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[21]  Xin Chen,et al.  Optimal algorithms for online scheduling with bounded rearrangement at the end , 2011, Theor. Comput. Sci..

[22]  Gerhard J. Woeginger,et al.  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..

[23]  Ning Ding,et al.  Online Minimum Makespan Scheduling with a Buffer , 2012, FAW-AAIM.

[24]  Zhiyi Tan,et al.  Online and Semi-online Scheduling , 2013 .

[25]  Yuzhong Zhang,et al.  The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine , 2009, Asia Pac. J. Oper. Res..

[26]  Pascal Bouvry,et al.  Internet shopping with price sensitive discounts , 2014, 4OR.

[27]  Malgorzata Sterna,et al.  The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..

[28]  Adam Wojciechowski,et al.  Towards Optimal Multi-item Shopping Basket Management: Heuristic Approach , 2010, OTM Workshops.

[29]  Malgorzata Sterna,et al.  Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy , 2004, AACC.

[30]  Chris N. Potts,et al.  A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work , 1994, Math. Oper. Res..

[31]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[32]  B. M. T. Lin,et al.  Two-machine flow-shop scheduling to minimize total late work , 2006 .

[33]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

[34]  Jacek Blazewicz,et al.  E-Commerce Evaluation - Multi-Item Internet Shopping. Optimization and Heuristic Algorithms , 2010, OR.

[35]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[36]  Shaohua Yu,et al.  Online scheduling with reassignment , 2008, Oper. Res. Lett..

[37]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[38]  Bahram Alidaee,et al.  Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms , 2002 .

[39]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..