instance stringlengths 3 13 | text stringlengths 2.83k 40.9k | label int64 1 3 |
|---|---|---|
01a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 1 |
02a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 2 |
03a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 3 |
04a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 1 |
05a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 2 |
06a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 3 |
07a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 2 |
08a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 3 |
09a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 3 |
10a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 1 |
11a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 2 |
12a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 3 |
13a_3s | 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 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computa... | 3 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6