Approximate the scheduling of quay cranes with non-crossing constraints
type: Item
instance of: scholarly article
title: Approximate the scheduling of quay cranes with non-crossing constraints
zbMATH Open document ID: 1394.90316
author: An Zhang
author: Wenshuai Zhang
author: Yong Chen
author: Guang-Ting Chen
author: Xufeng Chen
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6873546
zbMATH Keywords: scheduling
zbMATH Keywords: non-crossing
zbMATH Keywords: quay cranes
zbMATH Keywords: approximation algorithms
zbMATH Keywords: worst case analysis
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.10.021
OpenAlex ID: W2539000210
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 crane scheduling method for port container terminals
cites work: Loading, unloading and premarshalling of stacks in storage areas: survey and classification
cites work: Crane scheduling with spatial constraints
cites work: Algorithm Theory - SWAT 2004
cites work: A m‐parallel crane scheduling problem with a non‐crossing constraint
cites work: Scheduling small number of quay cranes with non-interference constraint
cites work: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
cites work: Crane scheduling in container yards with inter-crane interference
cites work: Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
cites work: Transshipment of containers at a container terminal: An overview
cites work: Crane scheduling with non-crossing constraint
DOI: 10.1016/J.EJOR.2016.10.021
description: scientific article; zbMATH DE number 6873546