instance stringlengths 14 14 | text stringlengths 10.2k 122k | label int64 1 3 |
|---|---|---|
instance_38402 | 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 |
instance_38414 | 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 |
instance_38426 | 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 |
instance_38427 | 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 |
instance_38428 | 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 |
instance_38429 | 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 |
instance_38430 | 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 |
instance_38431 | 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 |
instance_38432 | 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 |
instance_38433 | 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 |
instance_38434 | 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 |
instance_38435 | 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 |
instance_38436 | 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 |
instance_38437 | 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 |
instance_38438 | 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 |
instance_38439 | 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 |
instance_38440 | 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 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5