NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Atidel Ben Hadj-Alouane / rank
Normal rank
 
Property / author
 
Property / author: Atidel Ben Hadj-Alouane / 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.1016/j.ejor.2016.07.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2490581532 / 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: Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial cases of the economic lot sizing problem with cost discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity Acquisition, Subcontracting, and Lot Sizing / 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: Single item lot sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procurement model using capacity reservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The economic lot-sizing problem with an emission capacity constraint / 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: Dual sourcing using capacity reservation and spot market: optimal procurement policy and heuristic parameter determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity reservation contracts for high-tech industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing with Piecewise Concave Production Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic lot sizing: the capacity reservation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Lot Sizing with Batch Ordering and Truckload Discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inventory Policy with Multiple Set-Up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical model for a capacity reservation contract / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity reservation under supply uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sourcing decisions with capacity reservation contracts / 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: Multi-product lot-sizing with a transportation capacity reservation contract / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank

Revision as of 16:29, 15 July 2024

scientific article
Language Label Description Also known as
English
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
scientific article

    Statements

    NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    inventory
    0 references
    lot sizing
    0 references
    capacity reservation contract
    0 references
    complexity
    0 references
    polynomial time algorithm
    0 references
    0 references

    Identifiers