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 ÿnding a minimum makespan solution to SPTP. This problem is called SPTMP. We prove that, for any ÿx
✦ LIBER ✦
The minimal average latency of multiconfigurable pipelines
✍ Scribed by Jürgen Tappe
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 136 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown that the average latencies of all sequences of optimal cycles through a fixed vertex in the state graph of a multiconfigurable pipeline have a common limit, provided that their initiation numbers are unbounded and approximate the same ratio of the underlying operations. This leads to a definition of the minimal average latency of a multiconfigurable pipeline.
📜 SIMILAR VOLUMES
The complexity of makespan minimization
✍
Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 254 KB
The multiconfiguration methods in quantu
✍
Mathieu Lewin
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 88 KB
Improving the performance of natural gas
✍
F. Tabkhi; L. Pibouleau; G. Hernandez-Rodriguez; C. Azzaro-Pantel; S. Domenech
📂
Article
📅
2009
🏛
American Institute of Chemical Engineers
🌐
English
⚖ 337 KB
👁 2 views
Minimizing the average deviation of job
✍
John J. Kanet
📂
Article
📅
1981
🏛
John Wiley and Sons
🌐
English
⚖ 403 KB
Methods of minimizing functions that sat
✍
A. M. Gupal
📂
Article
📅
1978
🏛
Springer US
🌐
English
⚖ 245 KB
Minimizing the average deviation of job
✍
T.C.E. Cheng
📂
Article
📅
1987
🏛
Elsevier Science
⚖ 180 KB