The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2009.01.007 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-item capacitated lot-sizing problem with setup times and shortage costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-item lot-sizing problem with immediate lost sales / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uncapacitated lot-sizing problem with sales and safety stocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loss of customer goodwill in the uncapacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation based heuristics for lot sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Multi-Item Lot-Sizing Problems with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2009.01.007 / rank
 
Normal rank

Latest revision as of 13:33, 10 December 2024

scientific article
Language Label Description Also known as
English
The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
scientific article

    Statements

    The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (English)
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    lot-sizing
    0 references
    dynamic programming
    0 references
    Lagrangian heuristic
    0 references
    safety stocks
    0 references
    shortages
    0 references
    0 references

    Identifiers