The complexity of makespan minimization for pipeline transportation

Authors:
Ruy Luiz Milidiú;Artur Alves Pessoa;Eduardo Sany Laber
Affiliations:
Informatics Department of PUC-Rio, Brazil, Rua Marquês de São Vicente 225, EPLF, 13^0 andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil;Informatics Department of PUC-Rio, Brazil, Rua Marquês de São Vicente 225, EPLF, 13^0 andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil;Informatics Department of PUC-Rio, Brazil, Rua Marquês de São Vicente 225, EPLF, 13^0 andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil
Venue:
Theoretical Computer Science
Year:
2003

Citing 4
Cited 2

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
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization

A hybrid model for a multiproduct pipeline planning and scheduling problem

Constraints
Planning the transportation of multiple commodities in bidirectional pipeline networks

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	5.23

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 fixed ε 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.