{"id":"W2789142274","doi":"10.1017/s0269964818000402","title":"ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH","year":2018,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Notice; Schedule; Markov decision process; Computer science; Dynamic programming; Quality (philosophy); Capacity planning; Operations research; Scheduling (production processes); Space (punctuation); Process (computing); Mathematical optimization; Markov process; Operations management; Mathematics; Algorithm","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.002179631,0.001136016,0.002238236,0.001021482,0.0006655935,0.002148349,0.001672686,0.002151191,0.005211407],"category_scores_gemma":[0.006678848,0.001111181,0.0009559469,0.001556502,0.001180069,0.001566289,0.001215712,0.002080823,0.0002946364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002864335,"about_ca_system_score_gemma":0.0028399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02259393,"about_ca_topic_score_gemma":0.01226848,"domain_scores_codex":[0.9985857,0.0007114853,0.0000447878,0.0001968483,0.0002104459,0.0002508192],"domain_scores_gemma":[0.9947242,0.004311569,0.0003606202,0.00009234784,0.000294589,0.0002167154],"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.00001627099,0.00001570109,0.00008794734,0.00001443438,0.000008356595,0.00001845371,0.000008726538,0.9951305,0.00004316641,0.003229357,0.0001430541,0.001284106],"study_design_scores_gemma":[0.000003722561,0.0000052969,0.0000197662,0.000002899363,0.000002401219,0.000002888528,0.000005585951,0.998007,0.00002122481,0.001828458,0.00009906246,0.000001672921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04692366,0.0009099315,0.9408757,0.001394038,0.0001031541,0.0001681864,0.0003438217,0.0001883964,0.009093148],"genre_scores_gemma":[0.8838981,0.0007071118,0.1079637,0.0002361741,0.00009898696,0.0003994775,0.0002650504,0.00008825637,0.006343157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02259393,"threshold_uncertainty_score":0.04492486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09656401437862992,"score_gpt":0.4091299141877374,"score_spread":0.3125658998091075,"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."}}