{"id":"W1878146926","doi":"10.1007/3-540-44867-5_21","title":"A Framework for Designing Approximation Algorithms for Scheduling Problems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Fair-share scheduling; Two-level scheduling; Mathematical optimization; Rate-monotonic scheduling; Theoretical computer science; Algorithm; Mathematics; Schedule","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006997999,0.0003887008,0.0003770311,0.0004292645,0.0002122877,0.0002636337,0.0004532942,0.0004461626,0.000006707731],"category_scores_gemma":[0.0002544485,0.0004004912,0.000119402,0.0002839308,0.0001318305,0.0001814932,0.00004166751,0.0004656096,0.00000366991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002025371,"about_ca_system_score_gemma":0.0001003442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.900095e-7,"about_ca_topic_score_gemma":0.000001383542,"domain_scores_codex":[0.9981077,0.000007604964,0.0004192486,0.0006550028,0.0003157681,0.0004946918],"domain_scores_gemma":[0.9985746,0.0006164798,0.000123799,0.0003513556,0.0002377833,0.00009603118],"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.000002172531,0.000004825322,0.000001016131,0.0001524231,0.00001114366,5.086928e-7,0.0002645048,0.8445836,0.00003287601,0.003141445,0.000003369041,0.1518021],"study_design_scores_gemma":[0.0002346591,0.00005560918,2.783406e-7,0.0005146994,0.0000137891,0.000006095416,4.667039e-7,0.8382081,0.001661279,0.1586716,0.0002334809,0.000399996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004987831,0.000679548,0.9956955,0.0001022591,0.001875225,0.00116257,0.00001241056,0.0002812205,0.0001863361],"genre_scores_gemma":[0.0007989989,0.00003113569,0.9980282,0.0002790815,0.0005541667,0.0001347303,0.00002753153,0.00009719643,0.00004896033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1555301,"threshold_uncertainty_score":0.9998447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03122686509906015,"score_gpt":0.2595253631836189,"score_spread":0.2282984980845588,"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."}}