{"id":"W4384161751","doi":"10.1287/ijoc.2021.0138","title":"Overload-Checking and Edge-Finding for Robust Cumulative Scheduling","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Schedule; Mathematical optimization; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.00069149,0.0001761067,0.0002013585,0.0003547681,0.000466778,0.0002999885,0.0001144843,0.00008762117,0.000006227605],"category_scores_gemma":[0.000240609,0.0001606677,0.000081289,0.0003918963,0.00001856391,0.0002956829,0.0000426311,0.0004128856,0.00002104074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008631778,"about_ca_system_score_gemma":0.00002302107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.600938e-7,"about_ca_topic_score_gemma":2.195774e-7,"domain_scores_codex":[0.9988561,0.000008177551,0.0004169144,0.0001233869,0.0002012655,0.0003941853],"domain_scores_gemma":[0.999226,0.0003390176,0.0001213978,0.00007970773,0.0001004374,0.0001334702],"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.00000687993,0.000002539899,0.0003086858,0.00003167555,0.00003896983,0.00000589362,0.0008662248,0.9458079,0.00003287939,0.0002404825,0.00007224431,0.05258562],"study_design_scores_gemma":[0.0006674006,0.00004460576,0.00054822,0.0002822808,0.000009388427,0.00005696753,0.0006261099,0.9966736,0.0002863987,0.0002052958,0.0003892013,0.0002105016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4226407,0.0001125752,0.5741428,0.00007456404,0.001380158,0.0001310273,0.000002693603,0.0005142413,0.00100117],"genre_scores_gemma":[0.7494568,0.00008051923,0.2492479,0.0001400793,0.0009304739,0.000002887171,0.00001011585,0.00006212115,0.00006902555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3268161,"threshold_uncertainty_score":0.6551839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04248921437303536,"score_gpt":0.2846047074638869,"score_spread":0.2421154930908515,"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."}}