Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(NlogN) time

Authors:
Yi Feng;Shaoxiang Chen;Arun Kumar;Bing Lin
Affiliations:
School of Management and Economics, University of Electronic Science and Technology of China, Chengdu 610054, China;Nanyang Business School, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798, Singapore;School of Aerospace, Mechanical and Manufacturing Engineering, RMIT University, 124 LaTrobe Street, Melbourne, VIC 3000, Australia;Nanyang Business School, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798, Singapore
Venue:
Computers and Operations Research
Year:
2011

Citing 14
Cited 2

Approximation formulations for the single-product capacitated lot size problem

Operations Research
An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem

Management Science
A fully polynomial approximation scheme for single product scheduling in a finite capacity facility

Operations Research
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Improved algorithms for economic lot size problems

Operations Research
An O(T3) algorithm for the economic lot-sizing problem with constant capacities

Management Science
An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs

Management Science
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

Mathematics of Operations Research
The Infinite Horizon Periodic Review Problem with Setup Costs and Capacity Constraints: A Partial Characterization of the Optimal Policy

Operations Research
Dynamic Version of the Economic Lot Size Model

Management Science
Primal-Dual Algorithms for Deterministic Inventory Problems

Mathematics of Operations Research
TECHNICAL NOTE---Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time

Operations Research
An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost

Operations Research Letters

A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale

Computers and Operations Research
A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(NxTD"N)have been developed for solving the model, where N is the number of planning periods and TD"N is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(NlogN) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient.