Tail Assignment Problem with Hour-to-Cycle Ratio Constraints
收藏NIAID Data Ecosystem2026-05-02 收录
下载链接:
https://data.mendeley.com/datasets/z3s93b6r3r
下载链接
链接失效反馈官方服务:
资源简介:
There are 160 instances for the problem. Each file contains data for an instance.
The name of the files represents the parameter setting used.
N(x) indicates there are x aircraft in the instance.
delta(x) indicates that the difference between lower and upper bounds on hour-to-cycle ratio is x
k(LB-UB) indicates the cost of violating bounds on hour-to-cycle ratio for aircraft is generated from U(LB,UB)
m(LB-UB) indicates the early maintenance cost for aircraft is generated from U(LB,UB)
We have 5 replications for each parameter setting. rep(1), rep(2), rep(3), rep(4), and rep(5) indicates the replication number.
Also, There are 50 instances to assess the effect of variance on the problem. Each file contains data for an instance.
VarianceEffect_rep(x) indicates that the replication number is x.
创建时间:
2024-10-01



