{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507602,0.0005591073,0.001098961,0.001161725,0.001002289,0.001049599,0.00173836,0.001392871,0.001952236],"category_scores_gemma":[0.002500777,0.0004633918,0.0006769287,0.00105546,0.0009557232,0.0007979148,0.0008718158,0.0008994134,0.0002358482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001043077,"about_ca_system_score_gemma":0.001301825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00272704,"about_ca_topic_score_gemma":0.002398998,"domain_scores_codex":[0.9996011,0.0001660905,0.0000172484,0.00004328241,0.000125024,0.00004726894],"domain_scores_gemma":[0.9992612,0.0004354728,0.00006034214,0.00005663281,0.0001470221,0.00003930157],"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.000156359,0.0001141122,0.0002435587,0.0001041491,0.00009039672,0.0000799648,0.00008567025,0.9073929,0.002739775,0.01913806,0.002769912,0.0670851],"study_design_scores_gemma":[0.00002976598,0.00003991322,0.0000338024,0.000005815384,0.00001205092,0.00001626327,0.000006507048,0.996883,0.0004477897,0.001967218,0.0005512337,0.000006517476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02701659,0.0006564267,0.9640548,0.0004620653,0.0002861883,0.0001405135,0.00003710917,0.0004054152,0.006940905],"genre_scores_gemma":[0.5224509,0.0003829726,0.4707529,0.0003353081,0.0001525008,0.0004470231,0.00006186815,0.0001171331,0.00529946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00272704,"threshold_uncertainty_score":0.007973015,"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."}}