{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005368177,0.002932217,0.002586814,0.002363303,0.001730487,0.003983257,0.005227877,0.002355266,0.005164317],"category_scores_gemma":[0.01322525,0.001934941,0.003540235,0.004510891,0.002266673,0.005224505,0.003316477,0.006664804,0.002239397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002531586,"about_ca_system_score_gemma":0.002687964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003113009,"about_ca_topic_score_gemma":0.003333635,"domain_scores_codex":[0.9967103,0.001189089,0.000239534,0.0004011922,0.001128837,0.0003310314],"domain_scores_gemma":[0.9962602,0.002250257,0.0002054563,0.0006706147,0.0004565147,0.0001569868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000761802,0.0001394742,0.0002298656,0.0003284546,0.00008700815,0.0000824477,0.0001715127,0.2326646,0.001711055,0.6485228,0.01035185,0.1056348],"study_design_scores_gemma":[0.00005592946,0.00006522511,0.00006407344,0.00009736473,0.00004930695,0.00007866151,0.00004518201,0.5631011,0.0008041667,0.4184753,0.01713579,0.00002788163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005230602,0.0003388192,0.996929,0.0001673201,0.0000704394,0.00004557661,0.0000346551,0.0002185823,0.001672424],"genre_scores_gemma":[0.02870198,0.001287442,0.9668659,0.0001859425,0.0002646769,0.0003720493,0.0002167157,0.0002027495,0.00190252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005368177,"threshold_uncertainty_score":0.02838993,"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."}}