Crane Scheduling with Spatial Constraints

Publication Type

Journal Article

Publication Date

4-2010

Abstract

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. The objective is to find a crane-to-job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times.

Keywords

scheduling, dynamic programming, heuristics

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Naval Research Logistics

Volume

51

Issue

3

First Page

386

Last Page

406

ISSN

0894-069X

Identifier

10.1002/nav.10123

Publisher

Wiley

Additional URL

https://doi.org/10.1002/nav.10123

Link to Full Text

Share

COinS