text stringlengths 348 91k | label int64 0 1 |
|---|---|
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 |
.
Here is the feature summary: 20 number of jobs(n), 20 number of AGVs(k), 400 number of operations(i), Job-to-AGV ratio (n/k) is 1, Skewness(max(n/k, k/n)) is 1, Mean job completion times is 29,4, Minimum job completion times is 427, Maximum job completion times is 694, Maximum operation duration time is 49, Minimum o... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 ... | 1 |
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 |
.
Here is the feature summary: 20 number of jobs(n), 20 number of AGVs(k), 400 number of operations(i), Job-to-AGV ratio (n/k) is 1, Skewness(max(n/k, k/n)) is 1, Mean job completion times is 30,205, Minimum job completion times is 476, Maximum job completion times is 719, Maximum operation duration time is 49, Minimum... | 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 ... | 1 |
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 ... | 1 |
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.