NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract

•Single-item lot sizing problem is studied under a capacity reservation contract.•Batch deliveries are allowed and the overall replenishment cost is stepwise.•Four NP-hard cases are identified and an efficient FPTAS is proposed.•Pseudo-polynomial time dynamic programming algorithm is given for the g...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 257; no. 2; pp. 483 - 493
Main Authors:	Akbalik, Ayse, Hadj-Alouane, Atidel B., Sauer, Nathalie, Ghribi, Houcem
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.03.2017 Elsevier Sequoia S.A Elsevier
Subjects:	Algorithms Capacity reservation contract Complexity Computer Science Dynamic programming Inventory Lot sizing Operations Research Polynomial time algorithm Polynomials Studies Lot sizing Polynomial time algorithm Capacity reservation contract Inventory Complexity
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!