{"id":"W2171618037","doi":"10.1007/s00170-009-2388-x","title":"A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups","year":2009,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Flow shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Job shop; Fair-share scheduling; Sequence (biology); Minification; Algorithm; Mathematics; Routing (electronic design automation); Schedule","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.0001713601,0.0001881856,0.0002167963,0.0003429451,0.00008036165,0.00005886698,0.0008421867,0.0001010829,0.00000919889],"category_scores_gemma":[0.00003154899,0.0001359691,0.00007150903,0.0001176301,0.00005830458,0.0001918358,0.00003824271,0.0003912131,0.000003307852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001573467,"about_ca_system_score_gemma":0.00005006197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001116148,"about_ca_topic_score_gemma":0.000001931237,"domain_scores_codex":[0.9988245,0.000008541136,0.000415044,0.0001547012,0.0003336029,0.0002636389],"domain_scores_gemma":[0.9992067,0.00006034406,0.0002173333,0.0001908907,0.0002713861,0.00005335304],"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.00005381779,0.00001734762,0.00000872018,0.000004964568,0.000107743,0.00003495409,0.00005268583,0.8013642,0.001890852,0.0002343244,0.00001021024,0.1962202],"study_design_scores_gemma":[0.004218271,0.0008141198,0.0002092268,0.0003843081,0.0000977836,0.003985962,0.0006673911,0.5282966,0.4136225,0.04587613,0.001234081,0.0005936024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1610674,0.0004653548,0.8354161,0.002114629,0.0003650679,0.0002013723,0.000006890005,0.0002892302,0.00007391484],"genre_scores_gemma":[0.230162,0.0002353635,0.7692226,0.0001214538,0.0001529579,0.00001782346,0.000002508152,0.00002450134,0.00006074565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4117317,"threshold_uncertainty_score":0.5544658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01108233046633449,"score_gpt":0.2520856453898344,"score_spread":0.2410033149234999,"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."}}