{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002168898,0.000320852,0.0003228794,0.0001636486,0.0001176877,0.0001064697,0.0002944856,0.0001478016,0.0003428396],"category_scores_gemma":[0.00002528493,0.0003279231,0.0001348014,0.0003115589,0.00002984985,0.0001141885,0.00002679719,0.0002261594,0.0002410162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008693151,"about_ca_system_score_gemma":0.0000454652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001382452,"about_ca_topic_score_gemma":0.000004305007,"domain_scores_codex":[0.9983506,0.00002299559,0.0003610553,0.0004483941,0.0002719118,0.0005450671],"domain_scores_gemma":[0.9990339,0.00007944546,0.00005394491,0.0004842388,0.0001229077,0.0002255526],"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.000008538172,0.00007335647,0.0001425235,0.00005412808,0.0000397653,0.000003438013,0.0002256139,0.9707511,0.003044248,0.00006193035,0.000001037238,0.02559429],"study_design_scores_gemma":[0.001557841,0.0001341607,0.000117405,0.0000400096,0.0000304495,0.000007804756,0.0004505312,0.9937747,0.00316298,0.000008106214,0.0002800333,0.0004359522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3107082,0.000582161,0.6852921,0.00006570983,0.00114728,0.0005030184,0.0001202663,0.0009716089,0.0006096768],"genre_scores_gemma":[0.01772,0.00003920211,0.9797328,0.0001598759,0.0005629175,0.00004521435,0.0001577246,0.0001262841,0.001455979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2944407,"threshold_uncertainty_score":0.9999173,"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."}}