{"id":"W4396739004","doi":"10.1007/s10479-024-06000-w","title":"Correction: A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Flow shop scheduling; Permutation (music); Scheduling (production processes); Job shop scheduling; Distributed computing; Mathematical optimization; Operations research; Parallel computing; Mathematics; Embedded system; Routing (electronic design automation)","routes":{"ca_aff":true,"ca_fund":false,"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.003546554,0.001921564,0.001758399,0.003386143,0.001827759,0.003281398,0.004297008,0.004285843,0.1030868],"category_scores_gemma":[0.08389249,0.001021476,0.001888779,0.00407353,0.001635604,0.003454965,0.002133232,0.007746551,0.03684701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003077446,"about_ca_system_score_gemma":0.005119091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02204757,"about_ca_topic_score_gemma":0.01581294,"domain_scores_codex":[0.9971924,0.0005625962,0.0004257246,0.0005496517,0.001072066,0.0001976085],"domain_scores_gemma":[0.952729,0.009279851,0.001714779,0.003823878,0.03123693,0.001215491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006549169,0.000006536761,0.0001251484,0.0002407193,0.00003437663,0.000131531,0.00003867974,0.001019007,0.000104631,0.004229321,0.984761,0.009243643],"study_design_scores_gemma":[0.0001824039,0.00004439107,0.001635629,0.0004263907,0.0001136691,0.0007152962,0.0001517799,0.009047413,0.001018052,0.01660921,0.9699214,0.0001342499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"editorial","genre_gemma":"methods","genre_scores_codex":[0.0007383579,0.001351171,0.01556293,0.05714483,0.9101758,0.00007151371,0.007782714,0.001992547,0.005180174],"genre_scores_gemma":[0.1208914,0.0106175,0.06027272,0.07692755,0.4027061,0.0007787145,0.01612027,0.00668665,0.3049992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1030868,"threshold_uncertainty_score":0.3448598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1102558609773164,"score_gpt":0.3708159883636932,"score_spread":0.2605601273863768,"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."}}