Oliver Herr

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper studies the single machine family scheduling problem in which the goal is to minimize total tardiness. We analyze two alternative mixed-integer programming (MIP) formulations with respect to the time required to solve the problem using a state-of-the-art commercial MIP solver. The two formulations differ in the number of binary variables: the(More)
  • 1