Crane Scheduling with Spatial Constraints
In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously....
Saved in:
Main Authors: | LIM, Andrew, RODRIGUES, Brian, XIAO, Fei, ZHU, Yi |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2854 https://doi.org/10.1002/nav.10123 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A m-Parallel Crane Scheduling Problem with a Non-Crossing Constraint
by: LIM, Andrew, et al.
Published: (2007) -
Crane Scheduling Using Tabu Search
by: LIM, Andrew, et al.
Published: (2002) -
Crossdocking: JIT Scheduling with Time Windows
by: LI, Yanzhi, et al.
Published: (2004) -
Crane Scheduling using SWO with Local Search
by: LIM, Andrew, et al.
Published: (2002) -
A Simulated Annealing with Hill Climbing Algorithm for the Traveling Tournament Problem
by: LIM, Andrew, et al.
Published: (2006)