| Article ID: | iaor20081911 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 2 |
| Start Page Number: | 186 |
| End Page Number: | 194 |
| Publication Date: | Mar 2007 |
| Journal: | Operations Research Letters |
| Authors: | Chen Z.-L., Lei L., Zhong H. |
| Keywords: | heuristics, vehicle routing & scheduling, programming: linear |
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.