{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038743,0.0007411742,0.001261668,0.0008409034,0.0008698811,0.0008516642,0.001649304,0.001989204,0.00292246],"category_scores_gemma":[0.002063929,0.0007265689,0.0008890523,0.001268248,0.0008094399,0.0007508222,0.001018684,0.001101654,0.0003958355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001146137,"about_ca_system_score_gemma":0.002189334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01105335,"about_ca_topic_score_gemma":0.009106096,"domain_scores_codex":[0.9996456,0.00009286015,0.00001367917,0.00006908036,0.0001269661,0.00005182255],"domain_scores_gemma":[0.9993895,0.0003635568,0.00004985549,0.00003873407,0.0001162746,0.00004212771],"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.00006019589,0.00005257122,0.0001627766,0.0000256613,0.00002107092,0.00004255643,0.00002072902,0.9672605,0.000949925,0.00281067,0.0005480279,0.02804529],"study_design_scores_gemma":[0.00003297156,0.00001755448,0.00003603974,0.000001879959,0.000005482048,0.000008376034,0.000003111011,0.9983031,0.0001197991,0.001297526,0.0001713392,0.000002839331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03592643,0.0002220658,0.957481,0.0003722527,0.0001389105,0.0001490447,0.000068537,0.0005676396,0.005074103],"genre_scores_gemma":[0.3368204,0.0002094356,0.6572385,0.0001854815,0.00008298603,0.0003965735,0.0001426427,0.0001325514,0.004791273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01105335,"threshold_uncertainty_score":0.02197802,"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."}}