{"id":"W2142190389","doi":"10.1613/jair.2446","title":"A Constraint Programming Approach for Solving a Queueing Control Problem","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Queueing theory; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Concurrent constraint logic programming; Stochastic programming; Staffing; Control (management)","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.003949767,0.000116137,0.0002521728,0.000541935,0.0005492641,0.0003007688,0.0006220019,0.00008314176,0.00002001088],"category_scores_gemma":[0.0007620737,0.0001013637,0.0001706292,0.000743648,0.0003415486,0.000670354,0.00006879921,0.0005433654,0.000006852777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001369734,"about_ca_system_score_gemma":0.0007151716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002047395,"about_ca_topic_score_gemma":0.000008358311,"domain_scores_codex":[0.9974613,0.0001774961,0.0007944243,0.0002527893,0.0007950669,0.0005188895],"domain_scores_gemma":[0.9969792,0.0006191639,0.0002896417,0.0001971602,0.001712962,0.000201924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001163739,0.0002666638,0.0003508323,0.00004992607,0.00005769843,0.000058109,0.003173903,0.01698682,0.00466787,0.09554692,0.0001650835,0.8785598],"study_design_scores_gemma":[0.0002251705,0.0007607758,0.00007372317,0.0001002947,0.0000094968,0.000943691,0.002345729,0.9714916,0.01007893,0.01280761,0.0009318797,0.0002310555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002645436,0.00009619464,0.9949879,0.0009834715,0.0001492656,0.0006072512,0.000001064833,0.00003413355,0.0004953008],"genre_scores_gemma":[0.6219927,0.00003829626,0.3777409,0.00002555556,0.0001524294,0.00002165016,3.678045e-7,0.000006952506,0.00002107582],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9545048,"threshold_uncertainty_score":0.4224551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1580866694161495,"score_gpt":0.3793213777876778,"score_spread":0.2212347083715283,"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."}}