Graph Algorithms
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
| Hi-index | 0.00 |
PTP is a combinatorial model for oil pipeline transportation It uses a directed graph G and a set of product batches, where each batch has a corresponding destination node The graph G has an associated initial state where each arc contains a non-empty sequence of batches and each node contains a set of batches A valid movement is to shift the batches of a given arc a = (i,j) in such a way that one batch from the node i is inserted in the beginning of the arc a and another batch, removed from the end of the arc a, is inserted in j The goal is to reach a state where all batches from a given subset are stored at their destinations For the general PTP, deciding whether or not a feasible plan exists is proved to be ${\mathcal NP}$-hard. In this paper, we introduce the CBPTP, a new variation of PTP In this variation, arc contents may be shifted in both directions Moreover, we generalized the batch destination nodes by assigning a commodity to each batch and defining node demands For the general CBPTP, we give a polynomial algorithm for constructing feasible plans for the CBPTP, when they exist.