scientific article; zbMATH DE number 780785

MaRDI QIDQ4840775zbMATH OpenFDO

Authors Yves Pochet, Laurence A. Wolsey

Publication date 31 July 1995

zbMATH Keywords

cutting planeslot-sizingmulti-item multistage lot-sizingpolyhedral approachseparation algorithmssingle itemsurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Inventory, storage, reservoirs (90B05) Mixed integer programming (90C11)

Recommendations

• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Uncapacitated Lot-Sizing Problems with Start-Up Costs
• Progress with single-item lot-sizing
• Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
• Polyhedra for lot-sizing with Wagner-Whitin costs

Cited in

(33)

• A geometric characterization of ``optimality-equivalent relaxations
• Lot-size models with backlogging: Strong reformulations and cutting planes
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
• Progress with single-item lot-sizing
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• A stochastic programming approach for planning horizons of infinite horizon capacity planning problems
• Efficient reformulations for dynamic lot-sizing problems with product substitution
• Lot-sizing with fixed charges on stocks: the convex hull
• Reformulation by discretization: application to economic lot sizing
• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• Lot sizing with inventory gains
• Single item lot sizing problems
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• LS-LIB: a library of tools for solving production planning problems
• A polyhedral study of production ramping
• Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
• A polyhedral study of multiechelon lot sizing with intermediate demands
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Relaxations for two-level multi-item lot-sizing problems
• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
• A note on ``Lot-sizing with fixed charges on stocks: the convex hull
• A polyhedral study of lot-sizing with supplier selection
• scientific article; zbMATH DE number 910789 (Why is no real title available?)
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• Single item lot-sizing with non-decreasing capacities
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Lot-sizing on a tree

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 Q4840775)