Scheduling reclaimers serving a stock pad at a coal terminal

DOI10.1007/s10951-016-0495-8zbMath1391.90278OpenAlexW2523066569WikidataQ57955281 ScholiaQ57955281MaRDI QIDQ1707674

Thomas Kalinowski, Reena Kapoor, Savelsbergh, Martin W. P.

Publication date: 3 April 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0495-8

zbMATH Keywords

computational complexityapproximation algorithmbranch-and-boundreclaimer schedulingstockyard management

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A flexible job shop scheduling approach with operators for coal export terminals

Cites Work

• A reclaimer scheduling problem arising in coal stockyard management
• Crane scheduling in container yards with inter-crane interference
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Modeling and solving rich quay crane scheduling problems
• Yard crane scheduling in port container terminals
• Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals