{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005751175,0.0001206831,0.0002548461,0.001005205,0.0006243853,0.00004903517,0.0003916835,0.0001264228,0.00006275823],"category_scores_gemma":[0.0007865774,0.00009651279,0.00008423126,0.001351221,0.00006532233,0.0002703713,0.00004396086,0.0006011829,0.00002756625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005712919,"about_ca_system_score_gemma":0.001285957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009347445,"about_ca_topic_score_gemma":0.00002946816,"domain_scores_codex":[0.996269,0.0009649696,0.0009105857,0.0002882279,0.001106069,0.0004610893],"domain_scores_gemma":[0.9944834,0.0002283865,0.0003545769,0.0002879351,0.004421635,0.0002240336],"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.0005566651,0.0008463039,0.009559965,0.0001067542,0.0001309722,0.000007535101,0.004947086,0.9113703,0.007446875,0.0009561588,0.001117202,0.06295417],"study_design_scores_gemma":[0.004273481,0.002638239,0.01535698,0.001875159,0.00004138054,0.00004381017,0.0178253,0.9187481,0.002618242,0.001056091,0.03503026,0.0004929598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8455294,0.00008731904,0.1238384,0.02515812,0.002833328,0.001947243,0.0000218341,0.0001107369,0.0004735949],"genre_scores_gemma":[0.845323,0.0002193021,0.1516764,0.0001206802,0.001483042,0.0001746703,0.0001120685,0.00003916248,0.0008516364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0624612,"threshold_uncertainty_score":0.480233,"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."}}