{"id":"W2017773796","doi":"10.1023/b:apin.0000027769.48098.91","title":"Local Search Genetic Algorithms for the Job Shop Scheduling Problem","year":2004,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"Brock University","keywords":"Computer science; Crossover; Job shop scheduling; Tabu search; Genetic algorithm; Mathematical optimization; Operator (biology); Algorithm; Scheduling (production processes); Deadlock; Genetic operator; Local search (optimization); Schedule; Population-based incremental learning; Distributed computing; Artificial intelligence; Mathematics; Machine learning","routes":{"ca_aff":true,"ca_fund":true,"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.0002363724,0.0001888575,0.0001419393,0.00006253339,0.0001926098,0.00008388711,0.0003905942,0.0001022474,0.00004423557],"category_scores_gemma":[0.00001442957,0.0001527865,0.0000642748,0.0003434089,0.000118605,0.00004530729,0.00003989501,0.0002601314,0.0001764181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008916895,"about_ca_system_score_gemma":0.00005056626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001696365,"about_ca_topic_score_gemma":0.000005646997,"domain_scores_codex":[0.9988217,0.000005618492,0.0002871066,0.0002610862,0.0002212169,0.0004032355],"domain_scores_gemma":[0.9993525,0.0001573682,0.00002037229,0.0002938755,0.00008273123,0.00009320098],"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.000005057482,0.00001010173,0.000003883472,0.00002765119,0.00002668414,8.301256e-7,0.0003702724,0.8721408,0.0001763608,0.006109416,0.00001107325,0.1211179],"study_design_scores_gemma":[0.0001561962,0.00002557672,0.00001841477,0.0000227101,0.00001794961,0.000008236947,0.0008966235,0.9608138,0.03452756,0.003006756,0.0002856108,0.0002205534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001612654,0.0007593217,0.99507,0.0001537871,0.0002516734,0.0005759026,0.000004211787,0.0003329855,0.001239507],"genre_scores_gemma":[0.4839574,0.000210815,0.515329,0.00008602851,0.0001423498,0.000185031,0.000004840964,0.00004461628,0.00003989955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4823447,"threshold_uncertainty_score":0.6230451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02769975547881486,"score_gpt":0.2645209188918796,"score_spread":0.2368211634130648,"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."}}