{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214856,0.0001224758,0.0001347296,0.0001046808,0.0001249607,0.00003971,0.00006027407,0.0000461696,0.00001243564],"category_scores_gemma":[0.0001313938,0.00009452281,0.00003841616,0.00009888231,0.00001681121,0.00008047498,0.000006611782,0.0002212907,0.00002530293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004272005,"about_ca_system_score_gemma":0.00006888919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.804203e-7,"about_ca_topic_score_gemma":0.000003762804,"domain_scores_codex":[0.9987855,0.00003759559,0.000155276,0.0001775146,0.000118461,0.0007256802],"domain_scores_gemma":[0.9996122,0.00006512291,0.00002990631,0.00009320353,0.00009605895,0.0001035225],"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.0002145586,0.00007677349,0.00008197701,0.00002025845,0.000128653,8.101769e-7,0.0003718853,0.8043889,0.01689389,0.0008423629,0.0001237009,0.1768562],"study_design_scores_gemma":[0.001342117,0.0006355694,0.001068105,0.00006220912,0.00005090061,0.0003505412,0.0001792144,0.9922726,0.001962273,0.00170725,0.00007628406,0.0002929135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3383717,0.0001805166,0.6605258,0.0002362522,0.0003160905,0.000258864,0.000005571708,0.00008959637,0.0000156189],"genre_scores_gemma":[0.9782277,0.00009185468,0.02070616,0.00001312561,0.0005844202,0.00003964161,0.00000707828,0.00003974533,0.0002902586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.639856,"threshold_uncertainty_score":0.3854528,"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."}}