{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00155919,0.001940213,0.001889293,0.001576215,0.001051367,0.001690267,0.002215164,0.001897403,0.007400488],"category_scores_gemma":[0.004227599,0.001313905,0.001353826,0.002965363,0.0007585056,0.001806732,0.001436738,0.003019173,0.0009916821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001950401,"about_ca_system_score_gemma":0.003754841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01362161,"about_ca_topic_score_gemma":0.01167691,"domain_scores_codex":[0.9988117,0.0003848157,0.00005530372,0.0002021027,0.0003844254,0.0001617182],"domain_scores_gemma":[0.9980586,0.001417222,0.0001254656,0.00007315013,0.000233267,0.00009213469],"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.00006823913,0.000120602,0.0001860465,0.0001348585,0.00004215107,0.00006597767,0.00003665629,0.897911,0.0008069269,0.01338643,0.003730023,0.08351108],"study_design_scores_gemma":[0.00001794792,0.00002030335,0.00002897027,0.000007440876,0.000006960414,0.00001694489,0.000006980496,0.9934122,0.0002395755,0.005457449,0.0007799675,0.000005221389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001700187,0.0001384936,0.9961109,0.0001452701,0.00003112181,0.00009911737,0.00007299929,0.0002012886,0.001500586],"genre_scores_gemma":[0.04474505,0.0002761489,0.952602,0.0001064142,0.00004990379,0.0004023314,0.0002703017,0.0001675394,0.001380265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01362161,"threshold_uncertainty_score":0.02708465,"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."}}