Uncapacitated Lot-Sizing Problems with Start-Up Costs

DOI10.1287/OPRE.37.5.741zbMATH Open0696.90021OpenAlexW2072193992MaRDI QIDQ3474475FDOQ3474475

Authors: Laurence A. Wolsey 

Publication date: 1989

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

Full work available at URL: https://semanticscholar.org/paper/8df9a49fa3d6f9e51409378bc2eb22ab66e84334

Recommendations

• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
• Progress with single-item lot-sizing
• Uncapacitated lot-sizing with buying, sales and backlogging
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
• The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
• Lot-sizing with start-up times
• Lot-sizing with fixed charges on stocks: the convex hull
• Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
• Uncapacitated and capacitated facility location problems

zbMATH Keywords

strong valid inequalitiespolynomial separation algorithmuncapacitated economic lot-sizing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Cited In (25)

• The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
• Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
• Single-item dynamic lot-sizing problems: an updated survey
• A cutting plane approach to capacitated lot-sizing with start-up costs
• A cutting plane algorithm for a single machine scheduling problem
• Modeling industrial lot sizing problems: a review
• Title not available (Why is that?)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Uncapacitated lot-sizing: The convex hull of solutions
• MIP modelling of changeovers in production planning and scheduling problems
• On practical resource allocation for production planning and scheduling with period overlapping setups
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• Projections of the capacitated network loading problem
• Using separation algorithms to generate mixed integer model reformulations
• A polyhedral study of the single-item lot-sizing problem with continuous start-up costs
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• A cutting plane algorithm for MV portfolio selection model
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem
• CMIT, capacitated multi-level implosion tool
• Valid Inequalities for the Lasdon-Terjung Production Model
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
• A dual algorithm for the economic lot-sizing problem
• Lot-sizing with start-up times
• Period decompositions for the capacitated lot sizing problem with setup times

This page was built for publication: Uncapacitated Lot-Sizing Problems with Start-Up Costs

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