{"id":"W2165843305","doi":"10.1016/j.cor.2013.09.020","title":"Optimizing the strategic patient mix combining queueing theory and dynamic programming","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Case mix index; Solver; Computer science; Mathematical optimization; Integer programming; Linear programming; Operations research; Dynamic programming; Service (business); Operations management; Medicine; Mathematics; Economics; Business; Marketing","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.00334827,0.001539557,0.0024959,0.001843393,0.0007181831,0.002622376,0.001885574,0.001953501,0.004324257],"category_scores_gemma":[0.007236099,0.001574156,0.001131216,0.002221933,0.0007983423,0.002420625,0.001926407,0.00202036,0.0005778719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003413567,"about_ca_system_score_gemma":0.006574815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009643534,"about_ca_topic_score_gemma":0.007769633,"domain_scores_codex":[0.9977037,0.001141862,0.00007710479,0.0002838249,0.0003536102,0.0004398805],"domain_scores_gemma":[0.9968893,0.002268945,0.0002607963,0.00007692218,0.0002096782,0.0002943419],"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.00008028989,0.00008933815,0.000336406,0.00004182366,0.00003431136,0.00001590909,0.00001519417,0.9798749,0.0004278705,0.006575958,0.0006078262,0.01190012],"study_design_scores_gemma":[0.00001817204,0.00003905032,0.000105171,0.000005168816,0.00001303995,0.000009738431,0.00001039062,0.9925947,0.0001531519,0.006869189,0.0001758268,0.00000642692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04742382,0.0006234145,0.9459729,0.001051285,0.00009218606,0.0002276189,0.0001644101,0.0002857988,0.004158475],"genre_scores_gemma":[0.8214025,0.0006494566,0.1723893,0.0003241053,0.0001911753,0.0003465305,0.0002055355,0.0001562963,0.004335181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009643534,"threshold_uncertainty_score":0.02476734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1768395519797497,"score_gpt":0.4410135482310937,"score_spread":0.264173996251344,"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."}}