{"id":"W1955062487","doi":"10.1287/ijoc.2015.0645","title":"Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; University of British Columbia","funders":"","keywords":"Mathematical optimization; Computer science; Workload; Scheduling (production processes); Linear programming; Dynamic programming; Queueing theory; Bellman equation; Dynamic priority scheduling; Schedule; Mathematics","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.002145334,0.0006893904,0.001182058,0.0006278448,0.000442147,0.001042502,0.001224624,0.0009338274,0.002559198],"category_scores_gemma":[0.00837551,0.0007345841,0.0008253783,0.0006393373,0.000992019,0.001147989,0.001332041,0.00167682,0.000345554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001734049,"about_ca_system_score_gemma":0.00267299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01046251,"about_ca_topic_score_gemma":0.004743135,"domain_scores_codex":[0.9989191,0.0005511377,0.00004697223,0.0001125215,0.0002515182,0.0001187691],"domain_scores_gemma":[0.9959273,0.003043028,0.0002863685,0.0001972626,0.0004350386,0.0001110175],"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.00002799015,0.00001157936,0.0001607553,0.00001063543,0.000006830656,0.00001201008,0.00001899003,0.9893861,0.0001924132,0.00507074,0.00008218089,0.005019789],"study_design_scores_gemma":[0.000003411305,0.000004214582,0.000006876512,0.000001270417,6.872496e-7,0.000001736616,0.000001407864,0.9989503,0.0000725153,0.0008714847,0.00008478521,0.000001327437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009146957,0.00004887464,0.9892697,0.0001011661,0.00001452783,0.00003337261,0.00001707736,0.0001540709,0.001214285],"genre_scores_gemma":[0.6533083,0.0001974619,0.3423329,0.0001198437,0.00003842256,0.0004590604,0.0001248967,0.0001333167,0.003285826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01046251,"threshold_uncertainty_score":0.02080327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.164072637517607,"score_gpt":0.4497476770576229,"score_spread":0.2856750395400159,"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."}}