The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
type: Item
instance of: scholarly article
title: The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
zbMATH Open document ID: 1162.90417
author: Nabil Absi
author: S. Kedad-Sidhoum
published in: Computers \& Operations Research
publication date: 2009-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5566385
zbMATH Keywords: lot-sizing
zbMATH Keywords: dynamic programming
zbMATH Keywords: Lagrangian heuristic
zbMATH Keywords: safety stocks
zbMATH Keywords: shortages
MaRDI profile type: Publication
full work available at URL: j.cor.2009.01.007
OpenAlex ID: W2071926771
cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem
cites work: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
cites work: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
cites work: The multi-item capacitated lot-sizing problem with setup times and shortage costs
cites work: The single-item lot-sizing problem with immediate lost sales
cites work: The uncapacitated lot-sizing problem with sales and safety stocks
cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging
cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
cites work: Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs
cites work: Loss of customer goodwill in the uncapacitated lot-sizing problem
cites work: Lagrangean relaxation based heuristics for lot sizing with setup times
cites work: Q4139966
cites work: Dynamic version of the economic lot size model
cites work: Improved Algorithms for Economic Lot Size Problems
cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
cites work: Minimum Concave Cost Flows in Certain Networks
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Capacitated Multi-Item Lot-Sizing Problems with Time Windows
cites work: Validation of subgradient optimization
DOI: 10.1016/J.COR.2009.01.007
Recommended article: The multi-item capacitated lot-sizing problem with setup times and shortage costs
Recommended article: Multi-item capacitated lot-sizing with demand uncertainty
Recommended article: Dynamic capacitated lot sizing with random demand and dynamic safety stocks
Recommended article: The uncapacitated lot-sizing problem with sales and safety stocks
Recommended article: Multi-item capacitated lot-sizing problems with setup times and pricing decisions
Recommended article: Multi-item uncapacitated lot sizing problem with inventory bounds
Recommended article: Safety stock placement problem in capacitated supply chains
Recommended article: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
Recommended article: Capacitated lot sizing problems with inventory bounds
description: scientific article; zbMATH DE number 5566385