A reclaimer scheduling problem arising in coal stockyard management

被引：32

作者：

Angelelli, Enrico ^{[1
]}

Kalinowski, Thomas ^{[2
]}

Kapoor, Reena ^{[2
]}

Savelsbergh, Martin W. P. ^{[3
]}

机构：

[1] Univ Brescia, Brescia, Italy

[2] Univ Newcastle, Newcastle, NSW, Australia

[3] Georgia Inst Technol, Atlanta, GA 30332 USA

来源：

JOURNAL OF SCHEDULING | 2016年 / 19卷 / 05期

关键词：

Reclaimer scheduling; Stockyard management; Approximation algorithm; Complexity; PORT CONTAINER TERMINALS; NON-CROSSING CONSTRAINT; YARD CRANE; TIMES; ALGORITHM; BRANCH;

D O I：

10.1007/s10951-015-0436-y

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.

引用

收藏

页码：563 / 582

页数：20

相关论文

共 23 条

[1] A survey of berth allocation and quay crane scheduling problems in container terminals [J].

Bierwirth, Christian ;

Meisel, Frank .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :615-627

[2] A fast heuristic for quay crane scheduling with interference constraints [J].

Bierwirth, Christian ;

Meisel, Frank .

JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360

[3] A stockyard planning problem [J].

Boland, Natashia ;

Gulczynski, Damon ;

Savelsbergh, Martin .

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2012, 1 (03) :197-236

[4] THE CRANE SCHEDULING PROBLEM [J].

DAGANZO, CF .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) :159-175

[5] Stacker-reclaimer scheduling in a dry bulk terminal [J].

Hu, Dayong ;

Yao, Zhenqiang .

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2012, 25 (11) :1047-1058

[6] A crane scheduling method for port container terminals [J].

Kim, KH ;

Park, YM .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (03) :752-768

[7] Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals [J].

Kim, KY ;

Kim, KH .

NAVAL RESEARCH LOGISTICS, 2003, 50 (05) :498-514

[8]

Kim KY, 1999, INT J PROD ECON, V59, P425, DOI 10.1016/S0925-5273(98)00108-X

[9] Modeling and solving rich quay crane scheduling problems [J].

Legato, Pasquale ;

Trunfio, Roberto ;

Meisel, Frank .

COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) :2063-2078

[10] A m-parallel crane scheduling problem with a non-crossing constraint [J].

Lim, Andrew ;

Rodrigues, Brian ;

Xu, Zhou .

NAVAL RESEARCH LOGISTICS, 2007, 54 (02) :115-127