Article ID Journal Published Year Pages File Type
1143174 Operations Research Letters 2007 9 Pages PDF
Abstract

We consider a strongly NP-hard container vessel scheduling problem with bi-directional flows. We show that a special case of it is solvable as a linear program. This property is then used to design a heuristic for the general case.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Container vessel scheduling with bi-directional flows
Authors
, , ,