Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs

Common operation scheduling (COS) problems arise in real-world applications, such as industrial processes of material cutting or component dismantling. In COS, distinct jobs may share operations, and when an operation is done, it is done for all the jobs that share it. We here propose a 0-1 LP formulation with exponentially many inequalities to minimize the weighted number of tardy jobs. Separation of inequalities is in NP, provided that an ordinary min Lmax scheduling problem is in P. We develop a branch-and-cut algorithm for two cases: one machine with precedence relation; identical parallel machines with unit operation times. In these cases separation is the constrained maximization of a submodular set function. A previous method is modified to tackle the two cases, and compared to our algorithm. We report on tests conducted on both industrial and artificial instances. For single machine and general processing times the new method definitely outperforms the other, extending in this way the range of COS applications.

[1]  Manfred K. Warmuth,et al.  A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs , 1989, SIAM J. Comput..

[2]  Ana Respício,et al.  Bi-Objective Sequencing of Cutting Patterns , 2005 .

[3]  Muhammad Aslam Noor,et al.  Wiener-hopf equations and variational inequalities , 1993 .

[4]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[5]  Giovanni Felici,et al.  Sorting common operations to minimize the number of tardy jobs , 2014, Networks.

[6]  Gerhard J. Woeginger.  On the approximability of average completion time scheduling under precedence constraints , 2003, Discret. Appl. Math..

[7]  C. Potts,et al.  A genetic algorithm for two-dimensional bin packing with due dates , 2013 .

[8]  Claudio Arbib,et al.  On cutting stock with due dates , 2014 .

[9]  Peter J. Stuckey,et al.  Dynamic Programming to Minimize the Maximum Number of Open Stacks , 2007, INFORMS J. Comput..

[10]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[11]  Bertrand M. T. Lin,et al.  Optimal scheduling in film production to minimize talent hold cost , 1993 .

[12]  Thomas W. M. Vossen,et al.  The one-dimensional cutting stock problem with due dates , 2010, Eur. J. Oper. Res..

[13]  T. Cheng,et al.  The cutting stock problem — a survey , 1994 .

[14]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[15]  J. M. Valério de Carvalho,et al.  An integer programming framework for sequencing cutting patterns based on interval graph completion , 2011 .

[16]  Stefan Voß,et al.  Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..

[17]  Claudio Arbib,et al.  Maximum lateness minimization in one-dimensional bin packing , 2017 .

[18]  B. J. Lageweg,et al.  Scheduling identical jobs on uniform parallel machines , 1989 .

[19]  José Carlos Becceneri,et al.  A method for solving the minimization of the maximum number of open stacks problem within a cutting process , 2004, Comput. Oper. Res..

[20]  Gleb Belov,et al.  Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting , 2007, INFORMS J. Comput..

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

[22]  Chunming Qiao,et al.  On progressive network recovery after a major disruption , 2011, 2011 Proceedings IEEE INFOCOM.

[23]  Claudio Arbib,et al.  One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model , 2016, Int. Trans. Oper. Res..

[24]  Horacio Hideki Yanasse,et al.  Connections between cutting-pattern sequencing, VLSI design, and flexible machines , 2002, Comput. Oper. Res..

[25]  Sachin C. Patwardhan,et al.  Integration of planning and scheduling in multi-site plants: Application to paper manufacturing , 2005 .

[26]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[27]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[28]  Horacio Hideki Yanasse,et al.  An integrated cutting stock and sequencing problem , 2007, Eur. J. Oper. Res..

[29]  Horacio Hideki Yanasse.  On a pattern sequencing problem to minimize the maximum number of open stacks , 1997, Eur. J. Oper. Res..