{"id":"W2048113057","doi":"10.1016/j.sorms.2014.09.001","title":"Queueing-theoretic approaches for dynamic scheduling: A survey","year":2014,"lang":"en","type":"article","venue":"Surveys in Operations Research and Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University; University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Dynamic priority scheduling; Scheduling (production processes); Distributed computing; Mathematical optimization; Two-level scheduling; Fair-share scheduling; Layered queueing network; Operations research; Mathematics; Computer network; Quality of service","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.006722343,0.002001642,0.003420397,0.004466181,0.001098401,0.004930669,0.005220324,0.002679984,0.003732827],"category_scores_gemma":[0.01446501,0.001511266,0.001353747,0.01217761,0.002852104,0.007699391,0.002345694,0.00439016,0.00153363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00386158,"about_ca_system_score_gemma":0.003859249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004001274,"about_ca_topic_score_gemma":0.002178795,"domain_scores_codex":[0.996418,0.001004967,0.0003684502,0.000567233,0.001430768,0.0002106496],"domain_scores_gemma":[0.98919,0.008195332,0.0003408213,0.0007743206,0.001255846,0.0002437661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001256963,0.0005257278,0.001823181,0.003059024,0.0001422027,0.0001015516,0.0003074872,0.07253467,0.000882148,0.4849428,0.01278122,0.4227742],"study_design_scores_gemma":[0.00005088025,0.0001923494,0.001275176,0.0008914399,0.0001088697,0.0003922963,0.0003188124,0.2278928,0.0007096299,0.6681263,0.09993476,0.0001067197],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.004677215,0.3831325,0.5937046,0.003085761,0.001127687,0.0001104433,0.0002633391,0.0003237721,0.01357466],"genre_scores_gemma":[0.1380008,0.613731,0.2327743,0.00150897,0.008277996,0.0002725338,0.0006723288,0.0002637868,0.004498295],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006722343,"threshold_uncertainty_score":0.03555161,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09398401633335034,"score_gpt":0.3579786254718068,"score_spread":0.2639946091384565,"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."}}