{"id":"W2951567270","doi":"10.1287/ijoc.2018.0863","title":"Group Maintenance: A Restless Bandits Approach","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Lagrangian relaxation; Markov decision process; Heuristics; Computer science; Time horizon; Curse of dimensionality; Linear programming relaxation; Linear programming; Scheduling (production processes); Dynamic programming; Benchmark (surveying); Stochastic programming; Mathematics; Markov process","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":[],"consensus_categories":[],"category_scores_codex":[0.0004918813,0.0001481211,0.0001915795,0.0001157944,0.0001025934,0.0001439739,0.0001939112,0.00008422252,0.00003124573],"category_scores_gemma":[0.0000422897,0.0001114713,0.00008691264,0.0001827465,0.00001837001,0.0003490785,0.00003051199,0.0005217577,0.0001197901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001453192,"about_ca_system_score_gemma":0.00001631059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001306226,"about_ca_topic_score_gemma":2.376659e-7,"domain_scores_codex":[0.9989309,0.00001172911,0.0003715437,0.0001097714,0.0002282646,0.0003477966],"domain_scores_gemma":[0.9995148,0.00005055016,0.0000956416,0.0001695894,0.00007465989,0.00009479704],"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.0000211209,0.00001743307,0.0006974901,0.000056753,0.00002001214,0.000004870077,0.0002741,0.9746348,0.00006217934,0.002523149,0.001327939,0.02036016],"study_design_scores_gemma":[0.0008487524,0.0001197329,0.002249987,0.0002857411,0.000004687926,0.0002132638,0.0002078573,0.9855813,0.00008778759,0.0005433051,0.009609625,0.0002480016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4963787,0.00006556706,0.4304188,0.00005599293,0.002001656,0.0002587668,0.000001431868,0.0002504007,0.07056877],"genre_scores_gemma":[0.9919296,0.0000723525,0.00738139,0.000174999,0.0002428148,0.000001261217,0.000005386096,0.00002459346,0.0001676281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4955509,"threshold_uncertainty_score":0.4545668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006555777813665351,"score_gpt":0.1982996675055645,"score_spread":0.1917438896918992,"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."}}