Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060107668 / 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: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / 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: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / 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: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover / 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: Improved lower bounds for the capacitated lot sizing problem with setup times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Lot-Sizing Model with Demand Time Windows / 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: Q4040299 / 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: Four equivalent lot-sizing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate extended formulations / 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: Lot-sizing with production and delivery time windows / rank
 
Normal rank

Revision as of 01:11, 2 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
scientific article

    Statements

    Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (English)
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    integer programming
    0 references
    lot sizing
    0 references
    polyhedra
    0 references
    time windows
    0 references
    Lagrangian
    0 references
    0 references
    0 references

    Identifiers