{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007513475,0.0006528395,0.0006471201,0.0008306376,0.0004626188,0.0005880704,0.001284367,0.001126847,0.001635043],"category_scores_gemma":[0.001145856,0.000298194,0.0005168895,0.0008142623,0.0005370826,0.0005506247,0.0006363534,0.0006200301,0.0003120224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007489366,"about_ca_system_score_gemma":0.001137481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003934265,"about_ca_topic_score_gemma":0.003813969,"domain_scores_codex":[0.9996932,0.00008674655,0.00001040506,0.00005485822,0.0001209938,0.00003394434],"domain_scores_gemma":[0.9997079,0.0001453346,0.00003194929,0.00002332699,0.0000707575,0.00002068399],"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.00007103821,0.00006867068,0.0004908178,0.00003672926,0.00003771469,0.00005882869,0.00003511408,0.9262294,0.003438992,0.005723998,0.000950812,0.06285794],"study_design_scores_gemma":[0.00002903117,0.00002237712,0.0000549496,0.000002482191,0.000005910179,0.00001813491,0.000004321746,0.9977436,0.0004423528,0.001141419,0.0005326665,0.000002754172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06116976,0.0002941931,0.9318545,0.0002654621,0.00009147958,0.0001265608,0.00006797032,0.000783297,0.005346759],"genre_scores_gemma":[0.362098,0.0002175404,0.6328347,0.0001711834,0.00005234004,0.0003251146,0.0001782244,0.0000914189,0.004031453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003934265,"threshold_uncertainty_score":0.007822752,"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."}}