{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095118,0.000726733,0.0009892229,0.0007645856,0.0003996706,0.0007929916,0.001811568,0.001457899,0.00340833],"category_scores_gemma":[0.001660551,0.0004756781,0.0006671965,0.001001566,0.000485432,0.001048338,0.001005091,0.0006946457,0.000515745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006980427,"about_ca_system_score_gemma":0.0009849094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203708,"about_ca_topic_score_gemma":0.002340917,"domain_scores_codex":[0.9996645,0.00009259678,0.00001348794,0.00006678827,0.000104918,0.00005774732],"domain_scores_gemma":[0.9995393,0.0002823582,0.00004051584,0.00004416901,0.00005622107,0.0000375305],"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.0002807839,0.0001520158,0.0005232462,0.000184464,0.00006243667,0.00009830764,0.0001205104,0.8080015,0.005022773,0.0186322,0.00235571,0.164566],"study_design_scores_gemma":[0.00005812047,0.00006025922,0.00006288488,0.000005486813,0.000007020278,0.00002557546,0.00001203517,0.9953504,0.0004615802,0.003219752,0.0007314558,0.000005439937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02196717,0.0002337303,0.9737052,0.0001224908,0.00005309535,0.000096753,0.00004557331,0.0006130486,0.003162816],"genre_scores_gemma":[0.2649843,0.0001775107,0.7308914,0.0001077341,0.0000373134,0.0004583114,0.0002100396,0.0001489506,0.002984332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00340833,"threshold_uncertainty_score":0.01140207,"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."}}