论文信息 - Facets and Reformulations for Solving Production Planning With Changeover Costs

Facets and Reformulations for Solving Production Planning With Changeover Costs

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.

Thomas L. Magnanti | Trilochan Sastry | T. Magnanti | Trilochan Sastry

[1] G. D. Eppen,et al. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[2] Laurence A. Wolsey,et al. Uncapacitated Lot-Sizing Problems with Start-Up Costs , 1989, Oper. Res..

[3] C.P.M. van Hoesel. Models and algorithms for single-item lot sizing problems , 1991 .

[4] van Ca Cleola Eijl. A polyhedral approach to the discrete lot-sizing and scheduling problem , 1996 .

[5] Laurence A. Wolsey,et al. Algorithms and reformulations for lot sizing problems , 1994, Combinatorial Optimization.

[6] Albert P. M. Wagelmans,et al. Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs , 1992, SIAM J. Discret. Math..

[7] C. P. Van. Polyhedral Characterization of the Economic Lot-Sizing Problemwith Start-Up Costs , 1994 .

[8] Miguel Constantino,et al. A cutting plane approach to capacitated lot-sizing with start-up costs , 1996, Math. Program..

[9] Trilochan Sastry. Polyhedral structure of the product cycling problem with changeover costs , 1990 .

[10] Uday S. Karmarkar,et al. The Deterministic Dynamic Product Cycling Problem , 1985, Oper. Res..

[11] Thomas L. Magnanti,et al. A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs , 1990, Oper. Res..

[12] Hoesel van Cpm,et al. A linear description of the discrete lot-sizing and scheduling problem , 1994 .