Computational complexity of uncapacitated multi-echelon production planning problems

Authors:
Esther Arkin;Dev Joneja;Robin Roundy
Affiliations:
School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA;School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA;School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA
Venue:
Operations Research Letters
Year:
1989

Citing 1
Cited 15

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A genetic algorithm for joint replenishment based on the exact inventory cost

Computers and Operations Research
On the coordination of maintenance scheduling for transportation fleets of many branches of a logistic service provider

Computers & Mathematics with Applications
Optimizing replenishment polices using Genetic Algorithm for single-warehouse multi-retailer system

Expert Systems with Applications: An International Journal
MIP formulations and heuristics for two-level production-transportation problems

Computers and Operations Research
A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand

Mathematical and Computer Modelling: An International Journal
Uncapacitated two-level lot-sizing

Operations Research Letters
An effective and efficient differential evolution algorithm for the integrated stochastic joint replenishment and delivery model

Knowledge-Based Systems
Model and algorithm of fuzzy joint replenishment problem under credibility measure on fuzzy goal

Knowledge-Based Systems
Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem

International Journal of Applied Metaheuristic Computing
An efficient polynomial-time approximation scheme for the joint replenishment problem

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for the joint replenishment problem with deadlines

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Online control message aggregation in chain networks

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Modeling and optimization for the joint replenishment and delivery problem with heterogeneous items

Knowledge-Based Systems
RFID technology investment evaluation model for the stochastic joint replenishment and delivery problem

Expert Systems with Applications: An International Journal
Online aggregation problems

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently there has been a flurry of research in the area of production planning for multi-echelon production-distribution systems with deterministic non-stationary demands and no capacity constraints. A variety of algorithms have been proposed to optimally solve these problems, with varying success. This paper investigates the issue of computational complexity of the problem for all commonly studied product structures, i.e. the single item, the serial system, the assembly system, the one-warehouse-N-retailer system, the distribution system, the joint replenishment system, and the general production-distribution system. Polynomial time algorithms are available for the single-item, serial and assembly systems. We prove that the remaining problems are NP-complete.