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-andprice 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.