instance stringlengths 14 14 | text stringlengths 2.32k 50.5k | label int64 1 4 |
|---|---|---|
instance_08288 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_15187 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23829 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_23527 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_31338 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_31179 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_20943 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_15086 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_20688 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_14013 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_16167 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_13157 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_20648 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_08282 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_31736 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_16192 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23037 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_33582 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_12229 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_21341 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_16569 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_16379 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_21378 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_16256 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_15473 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_29989 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_06966 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_33457 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_08191 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_33424 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_21355 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_21880 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_31195 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_13412 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_04785 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_04115 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_32019 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_12694 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_14699 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_29915 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_22546 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_22458 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_15358 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_22554 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_32358 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_13336 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_31788 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_24380 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_23099 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_14682 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_29717 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_24838 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_05928 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23472 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_30020 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_15147 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23649 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_30590 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_28894 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_30984 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_04280 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_30791 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_31636 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_22382 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_22706 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_05626 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23619 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_12544 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_16011 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23585 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_04697 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_05961 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_30018 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_21405 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_22532 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_13109 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23842 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_21657 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_22132 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_31770 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_12943 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_14985 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_29179 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_23645 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_21693 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_13005 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_22662 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_14294 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_29589 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_25045 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 4 |
instance_05842 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_14615 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_30048 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_24266 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_25012 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_04505 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_14295 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 3 |
instance_08229 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
instance_12520 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 2 |
instance_32284 | You are an expert in classification. Your task is classifying which algorithm is the best for solving Flexible Job Shop Scheduling problem in 3 seconds with objective minimizing makespan. Choose algorithm that generates smaller makespan. If the makespan is the same, choose the algorithm with minimum computation time. L... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.