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