Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products

Authors:
Ruy Luiz Milidiú;Artur Alves Pessoa;Eduardo Sany Laber
Affiliations:
-;-;-
Venue:
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Year:
2002

Citing 4
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomially bounded minimization problems that are hard to approximate

Nordic Journal of Computing
Pipeline Transportation of Petroleum Products with No Due Dates

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics

The complexity of makespan minimization for pipeline transportation

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

SPTP is a model for the pipeline transportation of petroleum products. It uses a directed graph G, where arcs represent pipes and nodes represent locations. In this paper, we analyze the complexity of finding a minimum makespan solution to SPTP. This problem is called SPTMP. We prove that, for any 驴 0, there is no 驴1-驴-approximate algorithm for the SPTMP unless P = NP, where 驴 is the input size. This result also holds if G is both planar and acyclic. If G is acyclic, then we give a m-approximate algorithm to SPTMP, where m is the number of arcs in G.