{"id":"W2124761764","doi":"10.1287/ijoc.1080.0307","title":"A Constraint Programming Approach for Solving a Queueing Design and Control Problem","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Queueing theory; Mathematical optimization; Computer science; Constraint (computer-aided design); Decomposition; Benders' decomposition; Constraint programming; Stochastic programming; Control (management); Variety (cybernetics); Operations research; Service (business); Engineering; Mathematics; Artificial intelligence; Computer network; Economics","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01078455,0.0002003675,0.0003946606,0.0004269629,0.001189676,0.001741661,0.0003907053,0.00009186714,0.000004010488],"category_scores_gemma":[0.003139034,0.0001349025,0.0001847204,0.0004408229,0.0000850566,0.0004563957,0.0000323348,0.0004981491,0.000006066755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005988466,"about_ca_system_score_gemma":0.0001938131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002262769,"about_ca_topic_score_gemma":1.691044e-7,"domain_scores_codex":[0.9972246,0.0000828118,0.001028242,0.000309713,0.0007325514,0.000622094],"domain_scores_gemma":[0.9961501,0.002260862,0.0006578389,0.0001849531,0.0004851768,0.0002611221],"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.00009947037,0.0000762436,0.0004559708,0.000006273519,0.00004511992,0.000007576872,0.001126217,0.1612405,0.0001796675,0.005791992,0.0001636928,0.8308072],"study_design_scores_gemma":[0.002007264,0.0006714091,0.0005224711,0.0001654525,0.00003055352,0.0007198384,0.0009611872,0.974057,0.00009490721,0.01891352,0.001590253,0.0002661024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02437233,0.0001527139,0.9732025,0.0006583082,0.0001577616,0.0005584947,0.000001066294,0.00008158553,0.0008152532],"genre_scores_gemma":[0.5862747,0.000001629938,0.4131028,0.0004115767,0.000177036,0.000003180601,3.951539e-7,0.00000610425,0.00002260572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8305411,"threshold_uncertainty_score":0.9992946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0969777626073913,"score_gpt":0.3589317360212473,"score_spread":0.2619539734138561,"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."}}