A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging

DOI10.1007/978-3-540-68891-4_31zbMath1143.90314OpenAlexW1566816014MaRDI QIDQ3503865

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_31

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Production models (90B30) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

bc-prod

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Lot-sizing on a tree
L-shaped decomposition of two-stage stochastic programs with integer recourse
A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
A Dynamic Lot-Sizing Model with Demand Time Windows
A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
Improved Algorithms for Economic Lot Size Problems
A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
A branch and bound method for stochastic integer problems under probabilistic constraints
An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
Deterministic Production Planning with Concave Costs and Capacity Constraints
Production Planning by Mixed Integer Programming

This page was built for publication: A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging