The quay crane scheduling problem with time windows
type: Item
instance of: scholarly article
title: The quay crane scheduling problem with time windows
zbMATH Open document ID: 1241.90052
author: Frank Meisel
publication date: 2012-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6047246
zbMATH Keywords: container terminal
zbMATH Keywords: quay crane scheduling
zbMATH Keywords: crane time windows
zbMATH Keywords: \texttt{CPLEX}
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: nav.20471
OpenAlex ID: W2099189023
cites work: A fast heuristic for quay crane scheduling with interference constraints
cites work: A survey of berth allocation and quay crane scheduling problems in container terminals
cites work: A crane scheduling method for port container terminals
cites work: Algorithm Theory - SWAT 2004
cites work: A m‐parallel crane scheduling problem with a non‐crossing constraint
cites work: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
cites work: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
cites work: A tabu search heuristic for the quay crane scheduling problem
cites work: Crane scheduling with non-crossing constraint
DOI: 10.1002/NAV.20471
published in: Naval Research Logistics
description: scientific article; zbMATH DE number 6047246