Using column generation to solve parallel machine scheduling problems with minmax objective functions


In this paper we consider the parallel machine scheduling problem of minimizing an objective function of the minmax type, like maximum lateness, subject to release dates, deadlines, and/or generalized precedence constraints. We use a destructive strategy to compute a lower bound. Here we test the feasibility of a decision problem by applying column… (More)
DOI: 10.1007/s10951-010-0191-z

3 Figures and Tables


  • Presentations referencing similar topics