The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming

DOI10.1016/0166-218X(92)00182-LzbMath0793.90018OpenAlexW2015682010MaRDI QIDQ1317050

Roelof Kuik, Marc Salomon, Stan P. M. van Hoesel, Luk N. Van Wassenhove

Publication date: 24 March 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)00182-l

zbMATH Keywords

lotsizingsingle-item discrete lotsizing

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (10)

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Cascading knapsack inequalities: reformulation of a crude oil distribution problem ⋮ Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems ⋮ Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows ⋮ The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability ⋮ Single item lot sizing problems

Cites Work

• Unnamed Item
• The discrete lot-sizing and scheduling problem
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• An Efficient Algorithm for Multi-Item Scheduling

This page was built for publication: The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming