scientific article; zbMATH DE number 1757964

MaRDI QIDQ4537752zbMATH OpenFDO

Authors Andrew J. Miller, G. L. Nemhauser, Martin W. P. Savelsbergh

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810318

zbMATH Keywords

polyhedral combinatoricsmixed integer programmingproduction planningsetup timescapacitated lot-sizingfixed charge network flow

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11) Production models (90B30)

Recommendations

• A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
• On the polyhedral structure of a multi-item production planning model with setup times
• A polyhedral approach to a production planning problem
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• A polynomial algorithm for a multi-item capacitated production planning problem
• An optimal algorithm for the multi-item capacitated production planning problem
• scientific article; zbMATH DE number 4022999
• scientific article; zbMATH DE number 822146
• Computational study of the multiechelon production planning problem
• The multi-item capacitated lot-sizing problem with setup times and shortage costs

Cited in

(4)

• Facets and Reformulations for Solving Production Planning With Changeover Costs
• A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
• On the polyhedral structure of a multi-item production planning model with setup times
• Min-up/min-down polytopes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537752)