{"id":"W2997791715","doi":"10.1016/j.ifacol.2019.11.585","title":"An Efficient Two-Stage Genetic Algorithm for Flexible Job-Shop Scheduling","year":2019,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematical optimization; Job shop scheduling; Population; Computer science; Genetic algorithm; Coding (social sciences); Benchmark (surveying); Scheduling (production processes); Greedy algorithm; Single-machine 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.000807217,0.0009690386,0.0009510824,0.000926049,0.0006762462,0.0006712286,0.001516261,0.001569975,0.001358932],"category_scores_gemma":[0.001406492,0.0005176892,0.001037671,0.001053683,0.0004839175,0.0006331405,0.0008680389,0.0009985613,0.0003061161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008371362,"about_ca_system_score_gemma":0.002248083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007468323,"about_ca_topic_score_gemma":0.00657778,"domain_scores_codex":[0.9993964,0.0001734468,0.00002384511,0.0001062307,0.0002143797,0.0000857153],"domain_scores_gemma":[0.999683,0.0001608299,0.00003053568,0.00002784238,0.00007281383,0.00002497494],"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.00005990522,0.0001173148,0.0005676834,0.00006361589,0.00005048274,0.0001005838,0.00005964505,0.8971725,0.004931494,0.007682592,0.001337633,0.08785658],"study_design_scores_gemma":[0.00002500153,0.00004935788,0.0001007625,0.000003519829,0.000008408972,0.00002579664,0.000005011047,0.9972147,0.0005174601,0.001304134,0.0007392539,0.000006639039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01818417,0.0002099037,0.9783125,0.0001138397,0.00005222718,0.0001620258,0.00005191597,0.000540457,0.002373053],"genre_scores_gemma":[0.288235,0.0002374736,0.7070508,0.0001407717,0.00003221994,0.0004804541,0.0002863509,0.00008357177,0.003453335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007468323,"threshold_uncertainty_score":0.01484966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01132974474597966,"score_gpt":0.259915158024321,"score_spread":0.2485854132783414,"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."}}