{"id":"W2348420909","doi":"10.1287/ijoc.2015.0686","title":"A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":95,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Scheduling (production processes); Computer science; Time horizon; Constraint programming; Knapsack problem; Mathematics; Stochastic programming","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002346575,0.0001975434,0.0003097115,0.0001827012,0.002832652,0.0002012078,0.00008289104,0.0001901607,0.000008659724],"category_scores_gemma":[0.0009723409,0.000126819,0.00004417843,0.0001168331,0.00006870684,0.0003193677,0.00006247429,0.0006502245,0.000001920541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009436008,"about_ca_system_score_gemma":0.0003642316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001046454,"about_ca_topic_score_gemma":0.000002035011,"domain_scores_codex":[0.9980462,0.0001291659,0.0008430168,0.0002479661,0.0001832262,0.0005503769],"domain_scores_gemma":[0.997712,0.001163235,0.0003922703,0.0001055093,0.0003246694,0.0003023153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002073622,0.00007009386,0.1308811,0.0008906828,0.000103917,0.000009279217,0.01026203,0.1105731,0.000540374,0.008660434,0.00007257799,0.7377291],"study_design_scores_gemma":[0.004106257,0.0004257847,0.003202348,0.002717262,0.00002170959,0.0001139406,0.003371867,0.9840682,0.0000469795,0.0001433336,0.001411316,0.0003710357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3821188,0.0001537494,0.6154543,0.001279683,0.0001719825,0.0004784601,0.000003855418,0.00005008614,0.0002890626],"genre_scores_gemma":[0.7572356,0.00002085004,0.2410256,0.001272636,0.00036767,0.00001885564,0.000006326157,0.00002175917,0.00003063694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.873495,"threshold_uncertainty_score":0.9984655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07313580517315778,"score_gpt":0.3924170696532212,"score_spread":0.3192812644800634,"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."}}