{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007539647,0.0006421907,0.00116762,0.0009666631,0.0005496017,0.0005624319,0.00130452,0.0006557151,0.002254749],"category_scores_gemma":[0.001361378,0.0003900398,0.0006759369,0.000779391,0.0004071213,0.0007300187,0.0006630212,0.0007096393,0.0002241356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006715865,"about_ca_system_score_gemma":0.001502041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003249554,"about_ca_topic_score_gemma":0.00434535,"domain_scores_codex":[0.999405,0.000188825,0.00002799335,0.00008062527,0.0001895447,0.0001079932],"domain_scores_gemma":[0.9996277,0.0001893032,0.0000382393,0.00004419631,0.00006594318,0.00003461856],"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.0001304883,0.0001928194,0.0005346438,0.0001782944,0.00006285567,0.0002156799,0.00007179233,0.8644084,0.005802076,0.008250019,0.002067578,0.1180854],"study_design_scores_gemma":[0.00004050566,0.0001364823,0.0003046785,0.00001230329,0.00001656147,0.00007203912,0.00001873832,0.9921415,0.001752368,0.003041292,0.002450045,0.00001349531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08664484,0.001476818,0.8997906,0.0002290222,0.0002488332,0.0004232223,0.0002134836,0.00055612,0.01041708],"genre_scores_gemma":[0.5393091,0.0006247761,0.4525881,0.0001654341,0.00008425079,0.0003087035,0.0003970963,0.0001083528,0.006414202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003249554,"threshold_uncertainty_score":0.007542908,"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."}}