Scheduling reclaimers serving a stock pad at a coal terminal

被引：25

作者：

Kalinowski, Thomas ^{[1
]}

Kapoor, Reena ^{[1
]}

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

机构：

[1] Univ Newcastle, Newcastle, NSW, Australia

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

来源：

JOURNAL OF SCHEDULING | 2017年 / 20卷 / 01期

基金：

澳大利亚研究理事会;

关键词：

Reclaimer scheduling; Stockyard management; Approximation algorithm; Computational complexity; Branch-and-bound; CONTAINER TERMINALS; YARD CRANE; TIMES;

D O I：

10.1007/s10951-016-0495-8

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We study a variant of an abstract scheduling problem inspired by the management of reclaimers in the stockyard of a coal export terminal. We prove NP-completeness of the problem and formulate it as a mixed-integer program. We show that for a given reclaiming sequence, the problem can be solved in pseudo-polynomial time. In addition, we provide simple, constant-factor approximation algorithms as well as exact branch-and-bound algorithms. An extensive computational study analyzes the performance of the algorithms.

引用

页码：85 / 101

页数：17

共 12 条

[1] A reclaimer scheduling problem arising in coal stockyard management [J].