𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The quay crane scheduling problem with time windows

✍ Scribed by Frank Meisel

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
500 KB
Volume
58
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high-priority vessels while serving low-priority vessels casually. This article provides a mathematical formulation of the problem and a tree-search-based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time.

πŸ“œ SIMILAR VOLUMES

Single-vehicle scheduling with time wind
Single-vehicle scheduling with time window constraints
✍ Gilbert H. Young; Chi-Lok Chan πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 164 KB

In the single-vehicle scheduling problem with time window constraints, a vehicle has to visit a set of sites on a graph, and each site must be visited after its ready time but no later than its deadline. The goal is to minimize the total time taken to visit all sites. We prove the conjecture propose

The Loading Time Scheduling Problem
The Loading Time Scheduling Problem
✍ Randeep Bhatia; Samir Khuller; Joseph (Seffi) Naor πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 226 KB

In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a specified subset of the set of machines. Each machine has a loading time that is incurred only for the first task that is scheduled on the machine in a particular run. This basic scheduling p