{"id":"W4312371765","doi":"10.1016/j.ifacol.2022.10.100","title":"A Didactic Review On Genetic Algorithms For Industrial Planning And Scheduling Problems*","year":2022,"lang":"en","type":"review","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Variety (cybernetics); Adaptation (eye); Genetic algorithm; Heuristic; Distributed computing; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004693536,0.0007327881,0.001773682,0.0002798249,0.0002279129,0.00009383313,0.0003257168,0.000397771,0.0002152648],"category_scores_gemma":[0.0003981958,0.0006704489,0.0003934618,0.0005485603,0.00003502936,0.00007426423,0.00007672499,0.001143292,0.00001950634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002035264,"about_ca_system_score_gemma":0.0001537444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002859306,"about_ca_topic_score_gemma":5.158536e-7,"domain_scores_codex":[0.997456,0.0001117564,0.0009006484,0.0006609179,0.0003559655,0.0005147283],"domain_scores_gemma":[0.9984984,0.0005817126,0.0002724594,0.0004045618,0.00003925439,0.000203559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000372332,0.00003033007,6.038458e-7,0.02969657,0.0002210614,0.00001495486,0.00006224067,0.02431191,1.280659e-7,0.000004530952,0.00002085795,0.9456331],"study_design_scores_gemma":[0.0007298542,0.0001805035,2.076277e-7,0.04608262,0.001187361,0.0001076652,0.00003901389,0.09768,3.351406e-7,0.000004726024,0.853105,0.0008826983],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000002721886,0.990596,0.005377876,0.00006748087,0.001053145,0.002114607,0.0002451434,0.0004020835,0.0001409364],"genre_scores_gemma":[5.974373e-8,0.6820284,0.315695,0.0001218092,0.0007187203,0.0006187842,0.0005398821,0.0001700925,0.0001073075],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9447504,"threshold_uncertainty_score":0.9995747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1278911622789643,"score_gpt":0.335204367061299,"score_spread":0.2073132047823348,"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."}}