Container-vessel scheduling with bi-directional flows

被引：21

作者：

Chen, Z. -L.

Lei, L.

Zhong, H.

机构：

[1] Rutgers State Univ, Rutgers Sch Business, MSIS Dept, Newark, NJ 07102 USA

[2] Univ Maryland, Robert H Smith Sch Business, College Pk, MD 20742 USA

[3] SUNY Coll Oneonta, New York, NY USA

来源：

OPERATIONS RESEARCH LETTERS | 2007年 / 35卷 / 02期

基金：

美国国家科学基金会;

关键词：

container vessel scheduling; bi-directional flow; heuristic; mathematical programming;

D O I：

10.1016/j.orl.2006.03.010

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：186 / 194

页数：9

共 17 条

[1] On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures [J].