{"id":"W2039040122","doi":"10.1504/ejie.2011.039869","title":"An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server","year":2011,"lang":"en","type":"article","venue":"European J of Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tabu search; Separable space; Job shop scheduling; Mathematical optimization; Algorithm; Variable neighborhood search; Computer science; Variable (mathematics); Branch and bound; Neighbourhood (mathematics); Mathematics; Metaheuristic","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004334526,0.0002324014,0.0002092247,0.00008564715,0.00007323951,0.00005438092,0.000202528,0.00003853932,0.00004822443],"category_scores_gemma":[0.00003596956,0.0001770183,0.00004409265,0.000169624,0.00003317584,0.0001121245,0.00003146471,0.000225686,0.000008060038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002415349,"about_ca_system_score_gemma":0.00001394379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001539613,"about_ca_topic_score_gemma":8.923135e-7,"domain_scores_codex":[0.9990618,0.00002992675,0.0002810532,0.0002095165,0.0001456147,0.0002721083],"domain_scores_gemma":[0.9994189,0.00007444602,0.00005104608,0.0002588762,0.00008276419,0.0001139746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002280171,0.00003688352,0.00001633345,0.00002116251,0.00007590235,0.000005937095,0.0002365599,0.9734309,0.0002381024,0.00001796069,0.0000880055,0.02580947],"study_design_scores_gemma":[0.001337469,0.0002165005,0.00001594991,0.00009081101,0.0000496919,0.00001711665,0.00004431396,0.9921001,0.005182823,9.95151e-7,0.0007052669,0.0002389531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04799189,0.0004853747,0.9456404,0.00001780872,0.0008912134,0.0008402518,0.0001084724,0.0007382402,0.003286348],"genre_scores_gemma":[0.4701979,0.00001644267,0.528595,0.00001590815,0.0007042405,0.00002734223,0.00005606485,0.000218579,0.0001685332],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.422206,"threshold_uncertainty_score":0.7218598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02078117553591455,"score_gpt":0.1942357114411154,"score_spread":0.1734545359052009,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}