Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Seyyed Mohammad Taghi Fatemi Ghomi / rank
Normal rank
 
Property / author
 
Property / author: Seyyed Mohammad Taghi Fatemi Ghomi / 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.1080/00207720903579013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965581939 / 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: The single-item lot-sizing problem with immediate lost sales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the multi-item multi-vehicles dynamic lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations / 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: An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem / 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: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing 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: Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266754 / 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: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets and algorithms for capacitated lot sizing / 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: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for capacitated economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers / 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: 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: Multi-item lot size determination and scheduling under capacity constraints / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:52, 3 July 2024

scientific article
Language Label Description Also known as
English
Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
scientific article

    Statements

    Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (English)
    0 references
    0 references
    0 references
    16 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    heuristic algorithm
    0 references
    decomposition
    0 references
    exact solution
    0 references
    lot-sizing
    0 references
    0 references
    0 references