{"id":"W3150443833","doi":"","title":"An Effective and Efficient Heuristic for N-Wait Flow Shop Production to Minimize Total Completion Time","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristics; Flow shop scheduling; Mathematical optimization; Computation; Computer science; Scheduling (production processes); Heuristic; Idle; Minification; Job shop scheduling; Algorithm; Mathematics; Schedule","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.00119166,0.0008527588,0.001154753,0.001058201,0.0008120455,0.0006297679,0.001406339,0.000712553,0.00187468],"category_scores_gemma":[0.001892555,0.0004936346,0.0008079835,0.0008276902,0.0008183592,0.0009702825,0.0005813196,0.000552106,0.0001974716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018849,"about_ca_system_score_gemma":0.002841749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004603068,"about_ca_topic_score_gemma":0.005165614,"domain_scores_codex":[0.999379,0.0002092986,0.00002840805,0.00008797301,0.0001556458,0.0001396621],"domain_scores_gemma":[0.9991709,0.0005139527,0.0001038642,0.00004273325,0.00009075395,0.00007781104],"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.0001381914,0.0001926391,0.0005373158,0.0001787768,0.00002894236,0.0001320845,0.00008181029,0.9336509,0.004621521,0.007143869,0.002077968,0.05121609],"study_design_scores_gemma":[0.00006597372,0.0001702042,0.0002585647,0.00001360493,0.00001987799,0.00005643553,0.00002550925,0.9939303,0.002237767,0.002183843,0.001023233,0.00001473299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07113104,0.000489648,0.9211928,0.0002456546,0.00009817955,0.0003794012,0.0001103432,0.000586834,0.005766045],"genre_scores_gemma":[0.575067,0.000274554,0.4217192,0.0001319634,0.00003980072,0.0003438391,0.0002197608,0.0001366358,0.002067169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004603068,"threshold_uncertainty_score":0.009152532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003822283741725099,"score_gpt":0.2099738247091343,"score_spread":0.2061515409674092,"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."}}