Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
The complexity of makespan minimization for pipeline transportation
Theoretical Computer Science
The multi-product pipeline scheduling system
Computers & Mathematics with Applications
Planning the transportation of multiple commodities in bidirectional pipeline networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Activity based scheduling simulator for product transport using pipeline networks
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
We introduce a new model for pipeline transportation of petroleum products with no due dates. We use a directed graph G with n nodes, where arcs represent pipes and nodes represent locations. We also define a set L of r transportation orders and a subset F 驴 L of further orders. A feasible solution to our model is a pumping sequence that delivers the products corresponding to all orders in L-F. We prove that the problem of finding such a solution is NP-hard, even if G is acyclic. For the special case where the products corresponding to orders in F are initially stored at nodes, we propose the BPA algorithm. This algorithm finds a feasible solution in O(r2 log r + s2(rn + logs)) time, where s is the total volume in the arcs of G. We point out that the input size is 驴(s). If G is acyclic, then BPA finds a minimum cost solution.