A Benders decomposition-based framework for solving quay crane scheduling problems
type: Item
instance of: scholarly article
title: A Benders decomposition-based framework for solving quay crane scheduling problems
zbMATH Open document ID: 1403.90504
author: Defeng Sun
author: Lixin Tang
author: Roberto Baldacci
published in: European Journal of Operational Research
publication date: 2018-11-19T00:00:00Z
full work available at URL: http://hdl.handle.net/11585/654305
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6981590
zbMATH Keywords: OR in maritime industry
zbMATH Keywords: container terminal
zbMATH Keywords: quay crane scheduling
zbMATH Keywords: logic-based Benders decomposition
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W2886847473
cites work: Partitioning procedures for solving mixed-variables programming problems
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 follow-up survey of berth allocation and quay crane scheduling problems in container terminals
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Generalized Benders decomposition
cites work: The crane scheduling problem: models and solution approaches
cites work: Q4523706
cites work: Logic-based Benders decomposition
cites work: Planning and Scheduling by Logic-Based Benders Decomposition
cites work: A crane scheduling method for port container terminals
cites work: Crane scheduling with spatial constraints
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: Yard crane scheduling in port container terminals
cites work: A tabu search heuristic for the quay crane scheduling problem
cites work: Operations research at container terminals: a literature update
cites work: Modeling and solution of the joint quay crane and truck scheduling problem
cites work: Transshipment of containers at a container terminal: An overview
cites work: Crane scheduling with non-crossing constraint
Wikidata QID: Q129368211
DOI: 10.1016/J.EJOR.2018.08.009
description: scientific article; zbMATH DE number 6981590