MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
type: Item
instance of: scholarly article
title: MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
zbMATH Open document ID: 1380.90105
author: Agostinho Agra
author: Maryse Oliveira
published in: European Journal of Operational Research
publication date: 2018-02-01T00:00:00Z
full work available at URL: http://hdl.handle.net/10773/18404
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6833460
zbMATH Keywords: berth allocation
zbMATH Keywords: quay crane scheduling
zbMATH Keywords: mixed integer formulations
zbMATH Keywords: branch and cut
zbMATH Keywords: rolling horizon heuristic
MaRDI profile type: Publication
OpenAlex ID: W2618401921
Wikidata QID: Q57736442
cites work: Description of 2-integer continuous knapsack polyhedra
cites work: Lifting two-integer knapsack inequalities
cites work: Scheduling cranes at an indented berth
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 generalized classification scheme for crane scheduling with interference
cites work: Reformulation by discretization: application to economic lot sizing
cites work: The berth allocation problem: models and solution methods
cites work: The crane scheduling problem: models and solution approaches
cites work: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
cites work: A crane scheduling method for port container terminals
cites work: The berth planning problem
cites work: Crane scheduling with spatial constraints
cites work: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
cites work: An adaptive large neighborhood search for the discrete and continuous berth allocation problem
cites work: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
cites work: A scheduling method for Berth and Quay cranes
cites work: A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
cites work: Optimal berth allocation and time-invariant quay crane assignment in container terminals
cites work: Optimal policies for the berth allocation problem under stochastic nature
cites work: Tactical berth allocation under uncertainty
DOI: 10.1016/J.EJOR.2017.05.040
description: scientific article; zbMATH DE number 6833460