A Vessel Scheduling Problem with Special Cases Conference Paper

abstract

• Springer International Publishing Switzerland 2015. 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.

authors

• Parsaei, Hamid

published proceedings

• OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS, ICORES 2014

author list (cited authors)

• Bora, S., Boros, E., Lei, L., Chovalitwongse, W. A., Lim, G. J., & Parsaei, H. R.

citation count

• 0

complete list of authors

• Bora, Selim||Boros, Endre||Lei, Lei||Chovalitwongse, W Art||Lim, Gino J||Parsaei, Hamid R

publication date

• January 2015

publisher

• Springer Nature  Publisher

published in

• Communications in Computer and Information Science  Journal

keywords

• Bender's Decomposition
• Minimum Cost Network Flow
• Vessel Scheduling

Digital Object Identifier (DOI)

• 10.1007/978-3-319-17509-6_8

International Standard Book Number (ISBN) 13

• 978-3-319-17508-9

start page

• 108

end page

• 125

volume

• 509

URL

• http%3A%2F%2Fdx.doi.org%2F10.1007%2F978-3-319-17509-6_8