Name
Abstract | ||
|---|---|---|
We study the inventory and distribution operations encountered in oil and petrochemical industry. We show some special cases for the NP-complete problem, and propose polynomial time solution methods. We propose two approaches for the main problem. One of them makes use of the minimum cost flow formulation of the same problem under some assumptions, and the other one uses Benders Decomposition. In addition, we propose another problem and its formulation which involves time-windows for delivery, for which the same approaches can be applied. However, methodology or the results for the latter problem are not given. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-17509-6_8 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Vessel scheduling,Bender's decomposition,Minimum cost network flow | Mathematical optimization,Job shop scheduling,Computer science,Time complexity,Minimum-cost flow problem,Benders' decomposition | Conference |
Volume | ISSN | Citations |
509 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Selim Bora | 1 | 2 | 1.43 |
| Endre Boros | 2 | 1779 | 155.63 |
| Lei Lei | 3 | 70 | 5.02 |
| w art chovalitwongse | 4 | 0 | 0.34 |
| Gino J. Lim | 5 | 115 | 16.51 |
| Hamid R. Parsaei | 6 | 1 | 1.75 |