text string | label int64 |
|---|---|
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving flexible flow shop scheduling problem in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. La... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.