Scheduling

Abstract

Scheduling problems are notoriously difficult and ILP models have not yet shown adequate strength for them to be competitive with other approaches. This chapter presents a time-indexed model for the Job-Shop problem that can be solved either by column generation or by a compact equivalent formulation. We present also an interesting approach for a one-machine problem for which a Dantzig-Wolfe decomposition was proposed. This example allows us to show how the Dantzig-Wolfe decomposition goes in the opposite direction with respect to the compactification techniques that we have extensively discussed in this book.