A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-014-0266-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054340597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Multilevel Lot-Sizing with a Bottleneck / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Methods for the Uncapacitated Dynamic Lot Size Problem / 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: Single item lot sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the single item capacitated dynamic lot size model / 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: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of bounds for a capacitated single-item lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic lot‐sizing model with production time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic lot-sizing model for major and minor demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Production and Inventory Models with Piecewise Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the multi-item single level capacitated lotsizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perishable Inventory Theory: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic lot sizing with constant capacities and concave inventory costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing with extensions: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Solution Structure for a Repairable Inventory Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four equivalent lot-sizing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / 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: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing with production and delivery time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem / 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

Latest revision as of 08:26, 10 July 2024

scientific article
Language Label Description Also known as
English
A Lagrangian heuristic for capacitated single item lot sizing problems
scientific article

    Statements

    A Lagrangian heuristic for capacitated single item lot sizing problems (English)
    0 references
    0 references
    23 June 2015
    0 references
    lot sizing
    0 references
    time windows
    0 references
    single item
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references

    Identifiers