{"id":"W2015050454","doi":"10.1007/s12293-012-0084-0","title":"A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic","year":2012,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Memetic algorithm; Computer science; Mathematical optimization; Fitness function; Job shop scheduling; Local search (optimization); Tabu search; Critical path method; Tournament selection; Flow shop scheduling; Generality; Evolutionary algorithm; Schedule; Algorithm; Crossover; Genetic algorithm; Artificial intelligence; Mathematics; Engineering","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00115842,0.0003348843,0.0004079357,0.000268603,0.0003521808,0.0001334362,0.0002370298,0.0001485636,0.00007453279],"category_scores_gemma":[0.0004845026,0.0003702125,0.0001656517,0.0005735042,0.0001195629,0.0001229566,0.00007589169,0.0003610071,0.0000323725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001984434,"about_ca_system_score_gemma":0.00007447339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402596,"about_ca_topic_score_gemma":4.396107e-7,"domain_scores_codex":[0.9975191,0.00008546632,0.0005494871,0.0003420615,0.0004084775,0.001095363],"domain_scores_gemma":[0.9981496,0.0008944182,0.00004174113,0.0003149152,0.0002459898,0.0003533339],"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.000003952202,0.00006091747,0.0001822761,0.0002471805,0.00003835553,0.000004200361,0.0003179194,0.9174406,0.0003030056,0.0001783818,0.00001158497,0.08121163],"study_design_scores_gemma":[0.000687932,0.00004130033,0.00007402569,0.0002093905,0.0001016512,0.00002423469,0.0003777442,0.9964159,0.001520147,0.00003517405,0.0000819655,0.000430567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04638638,0.00113335,0.9500015,0.00006019884,0.001384122,0.0003268533,0.00001057841,0.0005628223,0.0001342463],"genre_scores_gemma":[0.4856337,0.00000190001,0.5137379,0.00005651399,0.0004779872,0.000009651853,0.000006998116,0.00006875915,0.000006571368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4392474,"threshold_uncertainty_score":0.999875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03703961546244598,"score_gpt":0.3038008521982924,"score_spread":0.2667612367358464,"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."}}