instance stringlengths 14 14 | text stringlengths 2.32k 50.5k | label int64 1 4 |
|---|---|---|
instance_05657 | 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_22196 | 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_16602 | 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_22514 | 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_33294 | 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_04000 | 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_13485 | 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_12891 | 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_08276 | 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_20945 | 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_30391 | 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_12314 | 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_30625 | 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_05717 | 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_12083 | 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_15019 | 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_33017 | 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_21549 | 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_14320 | 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_15236 | 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_29035 | 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_22565 | 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_20772 | 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_23588 | 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_24757 | 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_32786 | 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_21557 | 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_14196 | 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_29670 | 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_12738 | 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_22685 | 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_13436 | 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_08275 | 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_12647 | 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_05700 | 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_12787 | 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_33470 | 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_25058 | 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_04118 | 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_23038 | 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_16457 | 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_12940 | 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_14299 | 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_13902 | 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_12596 | 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_08364 | 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_13102 | 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_21046 | 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_04479 | 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_16268 | 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_31300 | 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_32098 | 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_23429 | 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_15839 | 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_16353 | 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_23156 | 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_13802 | 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_23896 | 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_05387 | 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_13630 | 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_31454 | 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_15246 | 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_15255 | 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_16317 | 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_23165 | 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_29185 | 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_04770 | 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_04473 | 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_12953 | 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_22797 | 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_33513 | 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_22556 | 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_05523 | 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_20548 | 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_15046 | 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_16505 | 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_29450 | 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_05929 | 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_14945 | 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_21353 | 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_04327 | 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_22333 | 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_32587 | 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_04773 | 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_12653 | 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_29802 | 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_20860 | 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_03822 | 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_14132 | 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_22654 | 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_07156 | 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_30440 | 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_16461 | 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_21564 | 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_23722 | 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_24287 | 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_29642 | 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_29331 | 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_12796 | 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_31280 | 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.