{"id":"W4386934834","doi":"10.1080/00207543.2023.2259502","title":"An approximate dynamic programming approach to network-based scheduling of chemotherapy treatment sessions","year":2023,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo","keywords":"Scheduling (production processes); Markov decision process; Computer science; Dynamic programming; Exploit; Session (web analytics); Dynamic priority scheduling; Job shop scheduling; Operations research; Markov process; Operations management; Computer network; Engineering; Quality of service","routes":{"ca_aff":true,"ca_fund":true,"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.001357009,0.0009454844,0.001375719,0.000774689,0.0005725335,0.001267242,0.001806837,0.001182667,0.003823823],"category_scores_gemma":[0.002860359,0.000805228,0.0007735751,0.001337797,0.0007148961,0.0009541092,0.0008167548,0.001422187,0.0003274088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002483609,"about_ca_system_score_gemma":0.003008033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02214182,"about_ca_topic_score_gemma":0.01586842,"domain_scores_codex":[0.9991572,0.0003748066,0.00002662347,0.0001331246,0.0001744042,0.0001338673],"domain_scores_gemma":[0.9989352,0.0007398319,0.0001240525,0.00002954987,0.0001207608,0.00005065335],"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.0000102922,0.000008203482,0.0000532484,0.00001180261,0.000006664297,0.000007816427,0.000008375962,0.9937075,0.00005966211,0.003128815,0.0001352178,0.00286239],"study_design_scores_gemma":[0.000003284097,0.000006289374,0.00002128504,0.000001835161,0.000002345364,0.000003205113,0.000004564181,0.9979977,0.00002908327,0.001737326,0.0001912943,0.000001675947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005977587,0.0001532329,0.9905037,0.0002227534,0.00003186589,0.0000573639,0.00007060228,0.00009971142,0.002883096],"genre_scores_gemma":[0.6216994,0.0007282714,0.3672677,0.0001747138,0.0001225961,0.000731412,0.0002780341,0.0001347029,0.008863182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02214182,"threshold_uncertainty_score":0.0440259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2126057407319685,"score_gpt":0.5567484851511864,"score_spread":0.3441427444192179,"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."}}