Datasets:

zuhdifr
/

algorithm_selector_jssp_3algo_1s_features

Modalities:

Text

Formats:

Size:

Libraries:

Dataset card Data Studio Files Files and versions

xet

Community

Dataset Viewer

Auto-converted to Parquet Duplicate

Split (3)

train · 3.97k rows

text stringlengths 1.11k 14.7k	label int64 0 2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	2
You are an expert in multi class 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 th...	1
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	0
You are an expert in multi class 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 th...	1

End of preview. Expand in Data Studio

README.md exists but content is empty.

Downloads last month: 9