{"id":"W3162711431","doi":"10.5267/j.dsl.2021.2.006","title":"An improved NEH heuristic to minimize makespan for flow shop scheduling problems","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Job shop scheduling; Heuristics; Flow shop scheduling; Mathematical optimization; Heuristic; Scheduling (production processes); Computer science; Mathematics; Computational complexity theory; Algorithm; Routing (electronic design automation)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006800965,0.0001726191,0.0001923617,0.0002660499,0.0002511639,0.0004645887,0.0004950359,0.00005580713,0.00003894743],"category_scores_gemma":[0.000820959,0.0001704075,0.00006683558,0.001292915,0.00007730558,0.0003603426,0.00005212482,0.0001231973,0.00004571139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008423374,"about_ca_system_score_gemma":0.00007014339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001313627,"about_ca_topic_score_gemma":0.0000025818,"domain_scores_codex":[0.9981577,0.00001529568,0.000330551,0.0005570541,0.0004554766,0.0004839176],"domain_scores_gemma":[0.9986972,0.0002039011,0.00003073673,0.0005190127,0.000223659,0.0003254577],"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.000007793365,0.00001303784,0.00006032495,0.000008335098,0.00000325255,0.000004875516,0.0002258163,0.8370789,0.1327671,0.00001020806,0.0002044777,0.02961585],"study_design_scores_gemma":[0.0004012916,0.00002447787,0.0002672342,0.00004500152,0.000006929164,0.000009787514,0.0001446196,0.9860848,0.01210408,0.00005992416,0.0006077702,0.0002440472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1857949,0.00003676691,0.8114432,0.001123918,0.00115062,0.0002075819,0.000009995525,0.0002024178,0.00003052917],"genre_scores_gemma":[0.1348074,0.00000477998,0.8628888,0.002027083,0.0001549055,0.00004877735,0.00001089255,0.00003292326,0.00002439899],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1490059,"threshold_uncertainty_score":0.6949015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0182572285154163,"score_gpt":0.2752753612215371,"score_spread":0.2570181327061208,"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."}}