{"id":"W2049333831","doi":"10.1111/itor.12056","title":"A new hybrid parallel genetic algorithm for the job‐shop scheduling problem","year":2013,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Crossover; Tabu search; Computer science; Mathematical optimization; Job shop scheduling; Genetic algorithm; Algorithm; Local search (optimization); Scheduling (production processes); Mathematics; Artificial intelligence; 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004834169,0.0001364376,0.0001039891,0.0003352715,0.0002908415,0.0003680906,0.0004444696,0.00006808629,0.002444022],"category_scores_gemma":[0.00007158935,0.0001173163,0.00007716667,0.0003481346,0.00006156055,0.0003579066,0.00001166431,0.0004765956,0.0001947189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000212903,"about_ca_system_score_gemma":0.0002122864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002868888,"about_ca_topic_score_gemma":0.00005510947,"domain_scores_codex":[0.9983352,0.0000461437,0.0003617588,0.0002441697,0.0006777054,0.0003349791],"domain_scores_gemma":[0.9984715,0.0006268053,0.00001437114,0.0001654545,0.0006177591,0.0001040896],"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.000005109056,0.00002566156,0.0000304619,0.00000508493,0.00006013596,0.000001082434,0.0001116363,0.8578354,0.00007272651,0.0006023945,0.0008051884,0.1404451],"study_design_scores_gemma":[0.0006372664,0.00002030391,0.0005072021,0.0000247289,0.000004432894,0.00001901974,0.0001903875,0.992808,0.0002935275,0.001680415,0.003684158,0.0001305062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007466216,0.0003138521,0.9916946,0.004097312,0.0006291749,0.0008346526,0.00003294093,0.000086712,0.001564159],"genre_scores_gemma":[0.06229002,0.0003853015,0.9297788,0.00009377451,0.0005151341,0.001453247,0.00004647467,0.00004450525,0.005392761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1403146,"threshold_uncertainty_score":0.9984679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04438914968532886,"score_gpt":0.3332081255702888,"score_spread":0.28881897588496,"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."}}