A polyhedral approach to a production planning problem

DOI10.1023/A:1018963805173zbMATH Open0997.90031OpenAlexW55804789MaRDI QIDQ1593522FDOQ1593522

Authors: Miguel Constantino 

Publication date: 17 January 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018963805173

Recommendations

• A cutting plane approach to capacitated lot-sizing with start-up costs
• Facets and algorithms for capacitated lot sizing
• 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
• Production Planning by Mixed Integer Programming

zbMATH Keywords

production planningvalid inequalitiescutting plane algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)

Cited In (24)

• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• 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
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
• The application of preprocessing and cutting plane techniques for a class of production planning problems
• A general heuristic for production planning problems
• LS-LIB: a library of tools for solving production planning problems
• Title not available (Why is that?)
• Separation, dimension, and facet algorithms for node flow polyhedra
• Multiple machine continuous setup lotsizing with sequence-dependent setups
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• Multiindex optimal production planning problems
• A polynomial algorithm for a multi-item capacitated production planning problem
• Title not available (Why is that?)
• Description of 2-integer continuous knapsack polyhedra
• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
• Uncapacitated lot sizing with backlogging: the convex hull
• Simultaneous lotsizing and scheduling problems: a classification and review of models
• Valid Inequalities for the Lasdon-Terjung Production Model
• On the polyhedral structure of a multi-item production planning model with setup times
• A Non-Numerical Approach to Production Scheduling Problems
• Title not available (Why is that?)
• Facets and algorithms for capacitated lot sizing
• Lower bounds in lot-sizing models: A polyhedral study

This page was built for publication: A polyhedral approach to a production planning problem

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