The uncapacitated lot-sizing problem with sales and safety stocks
From MaRDI portal
Publication:5930740
DOI10.1007/s101070000191zbMath0992.90022MaRDI QIDQ5930740
Marko Loparic, Laurence A. Wolsey, Yves Pochet
Publication date: 3 October 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
dynamic programmingconvex hull of solutionsmixed integer programmingcombinatorial separation algorithmintegral polyhedralower bounds on stockspolyhedral descriptionproduction planningsalesuncapacitated lot-sizing model of Wagner-Whitin
Related Items
Inventory lot-sizing with supplier selection, Lot-sizing with fixed charges on stocks: the convex hull, Production planning with order acceptance and demand uncertainty, A computational analysis of lower bounds for big bucket production planning problems, Just-in-Time Planning and Lot-Sizing, Single-item dynamic lot-sizing problems: an updated survey, The profit maximizing capacitated lot-size (PCLSP) problem, A polyhedral study of lot-sizing with supplier selection, Planning production and workforce in a discrete-time financial model using scenarios modeling, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, The multi-item capacitated lot-sizing problem with setup times and shortage costs, A heuristic approach for big bucket multi-level production planning problems, MIP formulations and heuristics for two-level production-transportation problems, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, Convex hull results for generalizations of the constant capacity single node flow set, MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs, A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales, Workforce planning and financing on a production/capital discrete-time model, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Uses Software
