New exact methods for the time-invariant berth allocation and quay crane assignment problem
type: Item
instance of: scholarly article
title: New exact methods for the time-invariant berth allocation and quay crane assignment problem
zbMATH Open document ID: 1430.90373
published in: European Journal of Operational Research
publication date: 2019-01-18T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7003095
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: container terminal
zbMATH Keywords: berth allocation
zbMATH Keywords: quay crane assignment
zbMATH Keywords: integer programming
author: Juan Francisco Correcher
author: Ramón Alvarez-Valdes
author: José Manuel Tamarit
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.11.007
OpenAlex ID: W2899637295
cites work: MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
cites work: A survey of berth allocation and quay crane scheduling problems in container terminals
cites work: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
cites work: A scheduling method for Berth and Quay cranes
cites work: Robust scheduling for berth allocation and quay crane assignment problem
cites work: Operations research at container terminals: a literature update
cites work: Optimal berth allocation and time-invariant quay crane assignment in container terminals
cites work: Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
Wikidata QID: Q128973171
DOI: 10.1016/J.EJOR.2018.11.007
description: scientific article; zbMATH DE number 7003095