Problem Instances for Multi-crane Scheduling in Container Yard Terminal
收藏DataCite Commons2025-04-01 更新2025-04-16 收录
下载链接：
https://data.mendeley.com/datasets/txzgxpfvfd
下载链接
链接失效反馈官方服务：
资源简介：
Problem Instances for Multi-crane Scheduling in Container Yard Terminal
Data Abstract:
The problem environment for instances involves three cranes within two blocks. The number of tasks (excluding dummy tasks for the initial position and availability) ranges from 6 to 12. Each instance (.csv) comprises the following:
- K: Number of cranes
- Z: Number of blocks
- B: Number of bays within a block
- BL: The far-left bay of blocks
- BR: The far-right bay of blocks
- CBL: The crane operating range left
- CBR: The crane operating range right
- M: The bigM penalty
- unit: The constant processing time of a single container operation (or movement) by a yard crane
- clearance: The minimum safety distance between two adjacent YCs
- N: Number of tasks, excluding dummy tasks
- T: Number of time steps in the planning time horizon
- release: The release time of task i
- bay: The bay location of task i
- row: The row location of task i
- tier: The initial layer location of task i. If i is on the top of the stack, then 1
- initCraneBay: The bay location of dummy tasks (initial crane position)
- initCraneTime: The release time of dummy tasks (initial crane availability)
- OFV (Optimality Gap): The objective function value of the optimal solution or the best-found solution with the optimality gap.
提供机构：
Mendeley Data
创建时间：
2024-05-23
