Port-Call Optimization Data-Hub
Quay-Crane Scheduling Problem
The Quay-Crane Scheduling Problem (QCSP) determines how to sequence container handling tasks across multiple quay cranes assigned to a vessel, while respecting non-crossing and interference/safety-margin constraints. Objectives typically include minimizing vessel turnaround/makespan and smoothing crane workloads. QCSP is closely related to (and often integrated with) berth allocation and quay-crane assignment.
Optimization Focus
What is optimized, what is decided, which limits apply, and which data support the model.
Objective
- Minimize vessel handling time (makespan/turnaround).
- Reduce crane interference and empty travel; smooth workloads.
- Support multi-objective goals (e.g., energy or emissions) when needed.
Decision Variables
- Assignment of bay tasks to cranes over time (who does what, when).
- Sequence of tasks per crane and task start/finish times.
- Feasible crane moves along the quay (respecting safety margins).
Constraints
- Non-crossing: adjacent cranes cannot pass each other on the same rail.
- Interference/safety margins: minimum bay distance between cranes.
- Precedence between bay tasks; travel/hoist times and crane speeds.
Data Sources
- Bay-plan/stowage (import/export moves, work content per bay).
- QC performance curves (hoist/slew/trolley), rail distances, safety margins.
- TOS logs/telemetry; integrated BAP/QCAP inputs if coupled.
Related Port-Call Processes
Processes related to quay-crane scheduling — click a card to open the process page.
Click any card to open the process page related to the optimization problem.
Berth Visit
- Covers on‑quay operations and crane sequencing that implement berth allocation decisions.
Terminal Operations
- Procedures and resource deployment on terminals that influence crane assignment and throughput.
Main Assumptions
- Vessel’s bay-level work content is known (static QCSP variant).
- Assigned cranes operate on the same rail with non-crossing limits.
- Interference is modeled via safety margins (minimum bay gaps).
- Travel/handling times deterministic or scenario-based if robust/stochastic.
- Precedence constraints reflect stowage rules and operational logic.
Available Datasets
Publicly accessible and benchmark datasets for quay-crane scheduling research and validation.
🧭 Real-World Datasets
| Dataset / Case | Description |
|---|---|
| QCSPgen | Supplementary research data for tandem-QC operations; includes input sets used to validate an exact algorithm for real terminal scenarios (License: CC BY 4.0). |
| Tandem-QC | Open dataset coupling tandem-QC scheduling with truck/slot planning. Useful if the QCSP interacts with horizontal transport (License: CC BY 4.0). |
| Berth-and-QC | Weekly berth-and-QC planning instances. Good for experiments that link tactical berth plans with operational QC scheduling (License: CC BY-NC). |
⚙️ Synthetic Benchmark Instances
| Dataset | Description |
|---|---|
| QCSPgen | Official generator used in the literature to create the standard QCSP instance families. Page also links file format and benchmark results. |
| QCSPgen project page | Direct project page for the QCSP instance generator (configure bays, cranes, precedence, and safety margins). |
Real-world data are often proprietary (accessible via collaborations), while public benchmarks (Kiel sets, Kim & Park family, QCSPgen) enable reproducible comparisons.