Facets and Reformulations for Solving Production Planning With Changeover Costs

Thomas L. Magnanti () and Trilochan Sastry ()
Additional contact information
Thomas L. Magnanti: School of Engineering and Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Trilochan Sastry: Indian Institute of Management, Ahmedabad, India

Operations Research, 2002, vol. 50, issue 4, 708-719

Abstract: 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 problem, and we obtain optimal solutions to problem instances with up to 600 integer variables without resorting to branch-and-bound procedures.

Keywords: Valid inequalities; facets; lotsizing (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.50.4.708.2861 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:50:y:2002:i:4:p:708-719

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().