text stringlengths 603 46.1k | label int64 0 0 |
|---|---|
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
You are an expert in classification. Your task is classifying which CP solver is the best for solving JSSP problem in 30 seconds (minimizing makespan). If the objective value is the same, choose the solver with minimum computation time. Label it as 0 if CPLEX is better, and label it as 1 if OR-Tools is better. Here is ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.