{"id":"W4393994304","doi":"10.1007/s10479-024-05940-7","title":"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":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Flow shop scheduling; Computer science; Scheduling (production processes); Distributed computing; Permutation (music); Mathematical optimization; Job shop scheduling; Parallel computing; Mathematics; Embedded system","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449232,0.0001227158,0.0001223116,0.0003411908,0.0005739023,0.0005141468,0.0002102233,0.00009653276,0.00005083735],"category_scores_gemma":[0.0004540303,0.0001002023,0.00007954745,0.001152128,0.00007826938,0.0003884359,0.0000291198,0.0002776209,0.000007270837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006871864,"about_ca_system_score_gemma":0.0003854336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003229306,"about_ca_topic_score_gemma":0.00001739708,"domain_scores_codex":[0.998614,0.0000630366,0.0003159593,0.0002188615,0.0003827831,0.0004053264],"domain_scores_gemma":[0.997519,0.0003356636,0.000009649996,0.0002429168,0.001822525,0.00007025955],"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.00001349274,0.00003115835,0.00000159885,0.0002488671,0.00004445664,0.000001210789,0.0005456801,0.9934199,0.00006288715,0.003852955,0.001046403,0.0007314205],"study_design_scores_gemma":[0.0001837664,0.00003748277,0.000001303054,0.00008492079,0.0000137826,8.478425e-7,0.0008041032,0.9976472,0.000795089,0.0001492787,0.0001705414,0.0001116345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008547986,0.001161199,0.9925752,0.003987432,0.0000675203,0.000894084,0.000110258,0.0002067576,0.0001427857],"genre_scores_gemma":[0.4192063,0.0003066941,0.5777353,0.00004336947,0.0001166722,0.000695303,0.0007569915,0.00006685528,0.001072479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4183515,"threshold_uncertainty_score":0.495793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1292306165847016,"score_gpt":0.3796719194277512,"score_spread":0.2504413028430496,"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."}}