Learn More
We study a scheduling problem with changeover costs and capacity constraints. The problem is NP-complete and combinatorial algorithms for solving it have not performed well. We identify a general class of facets that subsumes as special cases some known facets from the literature. We also develop a cutting plane based procedure and reformulation for the(More)
  • 1