Dataset Viewer
Auto-converted to Parquet Duplicate
instance
stringlengths
18
18
text
stringlengths
5.47k
28.8k
label
int64
1
3
ood_instance_00001
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
ood_instance_00002
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
ood_instance_00003
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
ood_instance_00004
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
2
ood_instance_00005
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
ood_instance_00006
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
1
ood_instance_00007
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
ood_instance_00008
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
ood_instance_00009
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
2
ood_instance_00010
You are an expert in multi class classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 30 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum comput...
3
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
7