{"id":"W4391233586","doi":"10.2139/ssrn.4706325","title":"Approximate Linear Programming for a Queueing Control Problem","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Queueing theory; Linear programming; Computer science; Layered queueing network; Control (management); Mathematical optimization; Queueing system; Mathematics; Computer network; Artificial intelligence","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.002716038,0.00141307,0.002180282,0.001062782,0.0007850242,0.003093857,0.0020722,0.003823123,0.00679111],"category_scores_gemma":[0.01453158,0.001042311,0.000926083,0.00159148,0.001708289,0.002544567,0.002196126,0.002833917,0.0004266945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002893283,"about_ca_system_score_gemma":0.002600387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01289111,"about_ca_topic_score_gemma":0.005543513,"domain_scores_codex":[0.9986683,0.0006489884,0.00004304485,0.0001890435,0.000289376,0.000161131],"domain_scores_gemma":[0.9933361,0.005754753,0.0002148548,0.0001375892,0.0003735716,0.0001831295],"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.0001208244,0.00007895132,0.0001833843,0.0001201967,0.0000293454,0.00004364707,0.00005476784,0.9262691,0.0003467551,0.06139639,0.001548555,0.00980805],"study_design_scores_gemma":[0.000009582331,0.00001127125,0.00002162651,0.000004757153,0.000003974754,0.000004222376,0.00000767214,0.9839578,0.00004075916,0.01575568,0.0001799147,0.00000279686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01943487,0.0008152099,0.9691727,0.001554816,0.0001212674,0.00008638069,0.0001587242,0.0001210402,0.008534966],"genre_scores_gemma":[0.7738922,0.001509191,0.1948311,0.0006049247,0.0005019337,0.0006861305,0.0005018651,0.0002738993,0.02719873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01289111,"threshold_uncertainty_score":0.02563214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01458331953477408,"score_gpt":0.2810955688250589,"score_spread":0.2665122492902848,"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."}}