Single item lot-sizing problems with backlogging on a single machine at a finite production rate
From MaRDI portal
Publication:1887789
DOI10.1016/j.ejor.2003.04.001zbMath1067.90036OpenAlexW2085067859MaRDI QIDQ1887789
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.04.001
Related Items (4)
A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
Cites Work
- Dynamic Version of the Economic Lot Size Model
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- Computational Complexity of the Capacitated Lot Size Problem
- 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
- Note: Dynamic lot sizing for a finite rate input process
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: Single item lot-sizing problems with backlogging on a single machine at a finite production rate