{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008376407,0.0001380201,0.0001841961,0.0004616318,0.002704564,0.00389538,0.0007816714,0.00006492172,0.0001449263],"category_scores_gemma":[0.001330094,0.00008704107,0.00006689518,0.001397192,0.0004975916,0.0005117154,0.0004720699,0.00061062,0.0003149714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006185122,"about_ca_system_score_gemma":0.0002022065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004189607,"about_ca_topic_score_gemma":0.0001257442,"domain_scores_codex":[0.9954668,0.001774175,0.0004885506,0.0005214667,0.00116156,0.0005873989],"domain_scores_gemma":[0.9937333,0.004351927,0.0000433817,0.0006855107,0.001003843,0.0001820207],"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.00002536513,0.0002859871,0.0004979159,0.00001171502,0.0001202361,0.00001435339,0.02018215,0.2748328,0.00210488,0.2320296,0.00180348,0.4680915],"study_design_scores_gemma":[0.0002219216,0.0001374772,0.000643906,0.00005164562,0.000006923678,0.00002090266,0.02126593,0.95626,0.00006205327,0.02024423,0.0009274565,0.0001575976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.875684,0.0009937603,0.1176146,0.003706268,0.0003237701,0.0007719061,0.000002597661,0.00007719054,0.0008259094],"genre_scores_gemma":[0.9549091,0.00002036647,0.04426616,0.0001241139,0.00004592439,0.0001413558,0.000006558078,0.00001423829,0.0004722028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6814272,"threshold_uncertainty_score":0.9985938,"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."}}