The Robust Machine Availability Problem

We define and solve the robust machine availability problem in a parallel machine environment, which aims to minimize the number of identical machines required while completing all the jobs before a given deadline. Our formulation preserves a user-defined robustness level regarding possible deviations in the job durations. For better computational performance, a branch-and-price procedure is proposed based on a set covering reformulation. We use zero-suppressed binary decision diagrams (ZDDs) for solving the pricing problem, which enable us to manage the difficulty entailed by the robustness considerations as well as by extra constraints imposed by branching decisions. Computational results are reported that show the effectiveness of a pricing solver with ZDDs compared with a MIP solver.

[1]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[2]  Robert B. Harris.  Packing Method for Resource Leveling (PACK) , 1990 .

[3]  Mauro Dell'Amico,et al.  Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem , 2008, INFORMS J. Comput..

[4]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..

[5]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[6]  Shin-ichi Minato,et al.  Zero-suppressed BDDs and their applications , 2001, International Journal on Software Tools for Technology Transfer.

[7]  Raul Poler,et al.  Models for production planning under uncertainty: A review ☆ , 2006 .

[8]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[9]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[10]  George L. Vairaktarakis,et al.  Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .

[11]  Panos Kouvelis,et al.  Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .

[12]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[13]  Ulrich Pferschy,et al.  The Knapsack Problem with Conflict Graphs , 2009, J. Graph Algorithms Appl..

[14]  Sávio B. Rodrigues,et al.  An exact algorithm for minimizing resource availability costs in project scheduling , 2010, Eur. J. Oper. Res..

[15]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[16]  Mauro Dell'Amico,et al.  A note on exact algorithms for the identical parallel machine scheduling problem , 2005, Eur. J. Oper. Res..

[17]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[18]  Sou-Sen Leu,et al.  RESOURCE LEVELING IN CONSTRUCTION BY GENETIC ALGORITHM-BASED OPTIMIZATION AND ITS DECISION SUPPORT SYSTEM APPLICATION , 2000 .

[19]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[20]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[21]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

[22]  José M. Valério de Carvalho,et al.  A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times , 2007, Eur. J. Oper. Res..

[23]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[24]  Melvyn Sim,et al.  Robust linear optimization under general norms , 2004, Oper. Res. Lett..

[25]  Ihsan Sabuncuoglu,et al.  Optimization of schedule robustness and stability under random machine breakdowns and processing time variability , 2009 .

[26]  Elias Willem Hans,et al.  Resource Loading by Branch-and-Price Techniques , 2001 .

[27]  J. Winch,et al.  Supply Chain Management: Strategy, Planning, and Operation , 2003 .

[28]  Sheldon H. Jacobson,et al.  Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams , 2014, INFORMS J. Comput..

[29]  J. D. Wiest,et al.  Management Guide to PERT/CPM , 1969 .

[30]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[31]  François Vanderbeck,et al.  Branching in branch-and-price: a generic scheme , 2011, Math. Program..

[32]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[33]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[34]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[35]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..

[36]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[37]  Roel Leus,et al.  A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching , 2016 .

[38]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[39]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[40]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[41]  G. Wullink *,et al.  Scenario-based approach for flexible resource loading under uncertainty , 2004 .

[42]  Rolf H. Möhring,et al.  Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time , 1984, Oper. Res..

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

[44]  Christodoulos A. Floudas,et al.  A new robust optimization approach for scheduling under uncertainty: : I. Bounded uncertainty , 2004, Comput. Chem. Eng..

[45]  A. A. Farley.  A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[46]  Jan Van Damme,et al.  Project scheduling under uncertainty survey and research potentials , 2002 .

[47]  John N. Hooker,et al.  Decision Diagrams and Dynamic Programming , 2013, CPAIOR.

[48]  Ethel Mokotoff,et al.  Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .

[49]  Harald Dyckhoff,et al.  A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..

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

[51]  Manuel Iori,et al.  Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..

[52]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[53]  Willy Herroelen,et al.  Stability and resource allocation in project planning , 2004 .

[54]  Shin-ichi Minato,et al.  TCS-TRA-1369 TCS Technical Report Efficient Top-Down ZDD Construction Techniques Using Recursive Specifications by , 2013 .

[55]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[56]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..

[57]  François Vanderbeck,et al.  Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem , 2000, Oper. Res..

[58]  Marco E. Lübbecke,et al.  Discrete Optimization A branch-price-and-cut algorithm for multi-mode resource leveling ✩ , 2015 .

[59]  Christodoulos A. Floudas,et al.  A new robust optimization approach for scheduling under uncertainty: II. Uncertainty with known probability distribution , 2007, Comput. Chem. Eng..

[60]  Mauro Dell'Amico,et al.  Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

[61]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[62]  Said M. Easa,et al.  Resource Leveling in Construction by Optimization , 1989 .

[63]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

[64]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[65]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[66]  Erik Demeulemeester,et al.  Minimizing resource availability costs in time-limited project networks , 1995 .