NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
type: Item
instance of: scholarly article
title: NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
zbMATH Open document ID: 1394.90592
author: Ayse Akbalik
author: Nathalie Sauer
author: Houcem Ghribi
author: Atidel Hadj-Alouane
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 6872944
zbMATH Keywords: inventory
zbMATH Keywords: lot sizing
zbMATH Keywords: capacity reservation contract
zbMATH Keywords: complexity
zbMATH Keywords: polynomial time algorithm
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.07.028
OpenAlex ID: W2490581532
cites work: Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
cites work: Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
cites work: The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
cites work: Polynomial cases of the economic lot sizing problem with cost discounts
cites work: Capacity Acquisition, Subcontracting, and Lot Sizing
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Single item lot sizing problems
cites work: Q3410593
cites work: Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: A procurement model using capacity reservation
cites work: The economic lot-sizing problem with an emission capacity constraint
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
cites work: Dual sourcing using capacity reservation and spot market: optimal procurement policy and heuristic parameter determination
cites work: Capacity reservation contracts for high-tech industry
cites work: Lot Sizing with Piecewise Concave Production Costs
cites work: Economic lot sizing: the capacity reservation model
cites work: Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
cites work: Optimal Inventory Policy with Multiple Set-Up Costs
cites work: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
cites work: A mathematical model for a capacity reservation contract
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
cites work: Production Planning by Mixed Integer Programming
cites work: Capacity reservation under supply uncertainty
cites work: Sourcing decisions with capacity reservation contracts
cites work: An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
cites work: Multi-product lot-sizing with a transportation capacity reservation contract
cites work: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
cites work: Dynamic version of the economic lot size model
DOI: 10.1016/J.EJOR.2016.07.028
description: scientific article; zbMATH DE number 6872944