A reclaimer scheduling problem arising in coal stockyard management

DOI10.1007/s10951-015-0436-yzbMath1353.90055arXiv1402.4178OpenAlexW3098883957WikidataQ57955323 ScholiaQ57955323MaRDI QIDQ341465

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

Publication date: 16 November 2016

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

Full work available at URL: https://arxiv.org/abs/1402.4178

zbMATH Keywords

complexityapproximation algorithmreclaimer schedulingstockyard management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Storage Yard Management: Modelling and Solving, Scheduling reclaimers serving a stock pad at a coal terminal, Scheduling reclaimer operations in the stockyard to minimize makespan

Cites Work

• 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
• A crane scheduling method for port container terminals
• A fast heuristic for quay crane scheduling with interference constraints
• Yard crane scheduling in port container terminals
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Crane scheduling with non-crossing constraint
• Routing and Scheduling on a Shoreline with Release Times
• Special cases of traveling salesman and repairman problems with time windows
• Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
• A m‐parallel crane scheduling problem with a non‐crossing constraint