In this paper, we address the quay crane scheduling problem in maritime container terminals, with some new features on the machine environment. We consider rail-mounted cranes and we assume that they are not allowed to span all over the vessel and that they can work only in predefined time windows. We furthermore take into account one-way constraints on the crane movements. We present a mixed integer mathematical model and a heuristic algorithm to get feasible solutions to the problem. Finally, we report on some computational experience.
In this paper, we address the quay crane scheduling problem in maritime container terminals, with some new features on the machine environment. We consider rail-mounted cranes and we assume that they are not allowed to span all over the vessel and that they can work only in predefined time windows. We furthermore take into account one-way constraints on the crane movements. We present a mixed integer mathematical model and a heuristic algorithm to get feasible solutions to the problem. Finally, we report on some computational experience.
Quay crane scheduling with time windows, one-way, and spatial constraints
Marcello Sammarra
2011
Abstract
In this paper, we address the quay crane scheduling problem in maritime container terminals, with some new features on the machine environment. We consider rail-mounted cranes and we assume that they are not allowed to span all over the vessel and that they can work only in predefined time windows. We furthermore take into account one-way constraints on the crane movements. We present a mixed integer mathematical model and a heuristic algorithm to get feasible solutions to the problem. Finally, we report on some computational experience.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
