{"id":"W2121605956","doi":"10.1613/jair.4278","title":"Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Queueing theory; Computer science; Scheduling (production processes); Mathematical optimization; Layered queueing network; Dynamic priority scheduling; Schedule; Distributed computing; Mathematics; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006435577,0.001452227,0.001459166,0.001549799,0.001142058,0.00282454,0.002026592,0.00145168,0.001892191],"category_scores_gemma":[0.01540239,0.0007563622,0.001188388,0.002142887,0.001911582,0.003902886,0.002195963,0.002642799,0.0003363893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003059749,"about_ca_system_score_gemma":0.004660579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00508386,"about_ca_topic_score_gemma":0.004777087,"domain_scores_codex":[0.9959531,0.001799815,0.0002525584,0.0004815951,0.001175934,0.000336986],"domain_scores_gemma":[0.9895257,0.008286697,0.0005098211,0.0006021644,0.000767798,0.0003078768],"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.00004457059,0.0001030776,0.0006196233,0.0001270974,0.00005275517,0.00006253454,0.0001067957,0.833649,0.0009532784,0.1236897,0.0007857489,0.03980583],"study_design_scores_gemma":[0.000008441081,0.00002678347,0.00006833544,0.000009773559,0.00001173945,0.00001409731,0.00002209397,0.9481099,0.0002261545,0.05049564,0.0009987425,0.000008333745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007834559,0.0005973976,0.9883673,0.0004502537,0.00008402413,0.00005968776,0.00002123612,0.0001121705,0.002473431],"genre_scores_gemma":[0.4875472,0.001856693,0.5073157,0.0003108645,0.0004124222,0.0002166815,0.0001252162,0.0001331695,0.002082044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006435577,"threshold_uncertainty_score":0.03403497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06363703394117042,"score_gpt":0.3678860068633077,"score_spread":0.3042489729221373,"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."}}