Scheduling reclaimers serving a stock pad at a coal terminal
type: Item
instance of: scholarly article
title: Scheduling reclaimers serving a stock pad at a coal terminal
zbMATH Open document ID: 1391.90278
author: Thomas Kalinowski
author: Reena Kapoor
author: Martin W. P. Savelsbergh
published in: Journal of Scheduling
publication date: 2018-04-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6855417
zbMATH Keywords: reclaimer scheduling
zbMATH Keywords: stockyard management
zbMATH Keywords: approximation algorithm
zbMATH Keywords: computational complexity
zbMATH Keywords: branch-and-bound
Wikidata QID: Q57955281
MaRDI profile type: Publication
full work available at URL: s10951-016-0495-8
OpenAlex ID: W2523066569
cites work: A reclaimer scheduling problem arising in coal stockyard management
cites work: A survey of berth allocation and quay crane scheduling problems in container terminals
cites work: Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
cites work: Modeling and solving rich quay crane scheduling problems
cites work: Crane scheduling in container yards with inter-crane interference
cites work: Yard crane scheduling in port container terminals
DBLP publication ID: journals/scheduling/KalinowskiKS17
DOI: 10.1007/S10951-016-0495-8
description: scientific article; zbMATH DE number 6855417