Some complexity results and an efficient algorithm for quay crane scheduling problem
From MaRDI portal
Publication:5298341
DOI10.1142/S1793830916500580zbMath1355.90026MaRDI QIDQ5298341
Shijin Wang, Feng Chu, Ming Liu, Yin-Feng Xu
Publication date: 14 December 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Transport operations in container terminals: literature overview, trends, research directions and classification scheme
- A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
- A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
- Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks
- On a parallel machine scheduling problem with precedence constraints
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- Modeling and solving rich quay crane scheduling problems
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference constraints
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Operations research at container terminals: a literature update
- A critical-shaking neighborhood search for the yard allocation problem
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Algorithm Theory - SWAT 2004
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems