{"id":"W2605057693","doi":"10.1016/j.cie.2017.04.002","title":"An effective and efficient heuristic for no-wait flow shop production to minimize total completion time","year":2017,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Agency for Healthcare Research and Quality; University of Calgary; University of Kentucky","keywords":"Heuristics; Flow shop scheduling; Computation; Mathematical optimization; Computer science; Idle; Scheduling (production processes); Heuristic; Minification; Job shop scheduling; Mathematics; Algorithm; Schedule","routes":{"ca_aff":true,"ca_fund":true,"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.0002163045,0.0002046722,0.0002441356,0.0001238845,0.0001978058,0.0002175249,0.0001545424,0.0001219485,0.000004767123],"category_scores_gemma":[0.0003555603,0.0002330621,0.00004494272,0.00007461075,0.00001976817,0.0001208614,0.00004137399,0.0001668743,0.00001802542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008802055,"about_ca_system_score_gemma":0.000008652974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003398093,"about_ca_topic_score_gemma":1.212975e-7,"domain_scores_codex":[0.9991265,0.00001376085,0.0001934308,0.0002977233,0.0001172783,0.0002513315],"domain_scores_gemma":[0.9993153,0.00009459382,0.00003820274,0.0002993775,0.00008348478,0.0001690185],"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.00003446515,0.00001554496,0.00001454811,0.00002670599,0.00003048075,0.000001186585,0.0001355117,0.9784521,0.001738448,0.000009030938,0.000251125,0.01929085],"study_design_scores_gemma":[0.0009058378,0.0001098661,0.001019169,0.0001032397,0.00002337451,0.000008793995,0.000006803787,0.9962519,0.001093483,9.298368e-7,0.0002147132,0.0002618789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2726869,0.00001886383,0.7214808,0.00006236858,0.004574599,0.0007407308,0.00001848697,0.0003974262,0.00001982579],"genre_scores_gemma":[0.778146,0.000001871741,0.2184366,0.00001202791,0.003099449,0.000121845,0.00006001296,0.00008127699,0.00004094516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5054591,"threshold_uncertainty_score":0.9503998,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01478704902265844,"score_gpt":0.2233551509942481,"score_spread":0.2085681019715897,"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."}}