instance stringlengths 3 10 | text stringlengths 3.14k 192k | label int64 1 3 |
|---|---|---|
01a | You are an expert in 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 computation time. L... | 1 |
02a | You are an expert in 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 computation time. L... | 1 |
03a | You are an expert in 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 computation time. L... | 1 |
04a | You are an expert in 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 computation time. L... | 1 |
05a | You are an expert in 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 computation time. L... | 1 |
06a | You are an expert in 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 computation time. L... | 1 |
07a | You are an expert in 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 computation time. L... | 1 |
08a | You are an expert in 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 computation time. L... | 1 |
09a | You are an expert in 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 computation time. L... | 1 |
10a | You are an expert in 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 computation time. L... | 1 |
11a | You are an expert in 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 computation time. L... | 1 |
12a | You are an expert in 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 computation time. L... | 1 |
13a | You are an expert in 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 computation time. L... | 1 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7