{"id":"W3039856838","doi":"10.1016/j.cie.2020.106605","title":"An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time","year":2020,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Sequence (biology); Selection (genetic algorithm); Genetic algorithm; Mathematical optimization; Algorithm; Set (abstract data type); Benchmark (surveying); Scheduling (production processes); Computer science; Mathematics; Schedule; Artificial intelligence","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.0002452607,0.0004831484,0.000471608,0.0001686031,0.0001306057,0.0002565115,0.0003411378,0.0001931456,0.00001666116],"category_scores_gemma":[0.00004006548,0.0004989512,0.00007003141,0.000466784,0.00003655407,0.0002051006,0.00008678524,0.0005361824,0.000009938598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009072264,"about_ca_system_score_gemma":0.00007439964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001630071,"about_ca_topic_score_gemma":6.852212e-7,"domain_scores_codex":[0.9979944,0.00003450622,0.0004744779,0.0006179983,0.0002956316,0.0005830359],"domain_scores_gemma":[0.9988659,0.0001033081,0.00008184192,0.0003186623,0.00008043549,0.0005498296],"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.00003662116,0.00002640686,0.00005489293,0.00007566983,0.0001032398,0.00003344245,0.0002759915,0.9697606,0.001747993,0.00002357269,0.000007765396,0.02785383],"study_design_scores_gemma":[0.00326466,0.0002718412,0.00001240786,0.0001295954,0.0000767117,0.00003421532,0.00004195761,0.9921791,0.003207799,0.000001008627,0.0001781541,0.0006025537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1022803,0.0002782701,0.8951513,0.00010072,0.0003253859,0.0007274225,0.0001008846,0.001022496,0.00001323905],"genre_scores_gemma":[0.1881624,0.00001318863,0.8106654,0.00006921305,0.0007007592,0.00007086964,0.0001407885,0.000157954,0.0000194217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08588215,"threshold_uncertainty_score":0.9997462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02890173795538531,"score_gpt":0.2399162774381865,"score_spread":0.2110145394828012,"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."}}