text string | label int64 |
|---|---|
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job 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. Lab... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 2 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is the same, choose the algorithm wit... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving Flexible Job Shop Scheduling Problem with sequence dependent setup time and job precedence constraint in 30 seconds with objective minimizing makespan. Choose solver that generates smaller makespan. If the makespan is ... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.