Mathematical programming models and formulations for deterministic production planning problems

DOI10.1007/3-540-45586-8_3MaRDI QIDQ4735937zbMATH OpenFDO

Authors Yves Pochet

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2241/22410057.htm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Production models (90B30) Mixed integer programming (90C11) Applications of mathematical programming (90C90)

Recommendations

• Production Planning by Mixed Integer Programming
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Deterministic lotsizing models for production planning
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• A polyhedral approach to a production planning problem

Cited in

(20)

• An integrated mathematical programming model for offset planning.
• Time continuity in discrete time models. New approaches for production planning in process industries.
• Workforce planning in a lotsizing mail processing problem
• Formulating and solving production planning problems
• Long range planning in the process industries: A projection approach
• Mathematical programming formulations for approximate simulation of multistage production systems
• Conic programming models for production planning with clearing functions: formulations and duality
• Planning production and workforce in a discrete-time financial model using scenarios modeling
• Models and solution techniques for production planning problems with increasing byproducts
• On multi-item economic lot-sizing with remanufacturing and uncapacitated production
• Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
• Fix and relax heuristic for a stochastic lot-sizing problem
• Using \textsc{Zimpl} for modeling production planning problems
• LS-LIB: a library of tools for solving production planning problems
• A polyhedral study of production ramping
• Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes
• Mathematical programming models for optimizing partial-order plan flexibility
• Production Planning by Mixed Integer Programming
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration

This page was built for publication: Mathematical programming models and formulations for deterministic production planning problems

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