{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001600195,0.001132595,0.001439865,0.0008088312,0.0003941982,0.00149729,0.002105522,0.00201369,0.003294781],"category_scores_gemma":[0.003005379,0.0007275458,0.001026713,0.001137047,0.0009775958,0.001716013,0.001286604,0.001232291,0.0003641737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001479316,"about_ca_system_score_gemma":0.001590984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005577553,"about_ca_topic_score_gemma":0.003472415,"domain_scores_codex":[0.9988974,0.0005120827,0.00003740092,0.0002328896,0.000176244,0.0001438963],"domain_scores_gemma":[0.9988517,0.000620258,0.0002158884,0.00006566502,0.0001524534,0.00009410567],"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.000014027,0.000008222126,0.00004089892,0.00001055983,0.00001013541,0.00003105186,0.000005433058,0.9914806,0.0001909103,0.007129481,0.0001600947,0.0009185331],"study_design_scores_gemma":[0.000005167943,0.00001363097,0.00003150584,0.000001528849,0.000003791263,0.000008014784,0.000003644347,0.9957156,0.00003704564,0.004030208,0.0001462762,0.000003540802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04230617,0.0003211554,0.9484405,0.0007432809,0.0000700281,0.0001031889,0.0004694639,0.0002460938,0.007300152],"genre_scores_gemma":[0.945822,0.0003691144,0.04835443,0.00008691185,0.00005392153,0.0002014387,0.0003801927,0.00007036866,0.004661696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005577553,"threshold_uncertainty_score":0.01109022,"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."}}