• Mathematics
  • Published 1996

A time-indexed formulation for single-machine scheduling problems : branch-and-cut

@inproceedings{Akker1996ATF,
  title={A time-indexed formulation for single-machine scheduling problems : branch-and-cut},
  author={J. M. van den Akker and Cor A. J. Hurkens and Martin W. P. Savelsbergh},
  year={1996}
}
In Van den Akker, Va, Hoesel, and Savelsbergh [1994], we have studied a tume-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand side 1 and 2 for the convex hull of the monotone extension of the set of feasible schedules. In this paper, we discuss the development of a branch-and-cut algorithm based on these facet inducing inequalities. We describe separation algorithms for each class of… CONTINUE READING

Citations

Publications citing this paper.