The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
Authors:
- Jiang Hang ChenJCJiang Hang Chen
- Michel BierlaireMBMichel Bierlaire
- 1 July 2017
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 260 (2) , 613-624
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (71501126)
This publication has 13 references indexed in Scilit:
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminalsEuropean Journal of Operational Research, 2015
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problemEuropean Journal of Operational Research, 2014
- Modeling and solving rich quay crane scheduling problemsComputers & Operations Research, 2012
- A fast heuristic for quay crane scheduling with interference constraintsJournal of Scheduling, 2009
- A m‐parallel crane scheduling problem with a non‐crossing constraintNaval Research Logistics (NRL), 2006
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departuresNaval Research Logistics (NRL), 2005
- A crane scheduling method for port container terminalsEuropean Journal of Operational Research, 2004
- Crane scheduling with spatial constraintsNaval Research Logistics (NRL), 2004
- The Price of RobustnessOperations Research, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003