{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163055,0.0009475626,0.001344804,0.0008627845,0.0006342418,0.00107955,0.001954725,0.002729125,0.003078769],"category_scores_gemma":[0.002250447,0.0008305048,0.0009300471,0.0009811098,0.0006125298,0.0008201454,0.001130802,0.001232124,0.000449354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095162,"about_ca_system_score_gemma":0.00275318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009836839,"about_ca_topic_score_gemma":0.009310114,"domain_scores_codex":[0.9994954,0.0001494694,0.000021249,0.00009439253,0.0001557244,0.00008384419],"domain_scores_gemma":[0.9992853,0.0004443129,0.00005237325,0.00003532226,0.0001298713,0.00005280199],"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.0001289603,0.000137227,0.0003638032,0.00005311354,0.00003381913,0.00006616773,0.00004542002,0.9356624,0.002551838,0.004039504,0.0009300761,0.0559878],"study_design_scores_gemma":[0.00003724308,0.00003524968,0.00005607402,0.000002809764,0.00000588165,0.00000799091,0.000003287993,0.9989759,0.00017748,0.0005357726,0.0001585432,0.000003875315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02571039,0.0001471691,0.9698783,0.000194635,0.00008303231,0.0001753871,0.0000633194,0.0005513642,0.003196458],"genre_scores_gemma":[0.3045699,0.0001247745,0.6904743,0.0002174339,0.00004364624,0.0005399155,0.0002199508,0.000107203,0.003702847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009836839,"threshold_uncertainty_score":0.0195592,"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."}}