{"id":"W1980330344","doi":"10.1109/icecs.2011.6122378","title":"Rules class approach to scheduling algorithms","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Fair-share scheduling; Scheduling (production processes); Dynamic priority scheduling; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Two-level scheduling; Job shop scheduling; Flow shop scheduling; Distributed computing; Algorithm; Embedded system; Mathematical optimization; Computer network; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001079054,0.0001388483,0.0001259301,0.0001149347,0.00004716116,0.00003358594,0.0001690069,0.00007949841,0.0001862932],"category_scores_gemma":[0.00001795369,0.0001303086,0.00004214113,0.0002181965,0.00001370898,0.00009409213,0.00002682026,0.0001147177,0.0005304856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002472078,"about_ca_system_score_gemma":0.000008061801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001358476,"about_ca_topic_score_gemma":7.30845e-7,"domain_scores_codex":[0.9992744,0.000008491041,0.0001693249,0.0001790336,0.0001214478,0.0002473482],"domain_scores_gemma":[0.9995664,0.00001086722,0.000009818083,0.0002077722,0.0000432108,0.0001619456],"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.000009426972,0.0001530233,0.0002820159,0.00005710904,0.000109241,0.000004912529,0.00335076,0.9394697,0.0002390702,0.01602578,0.001212784,0.03908619],"study_design_scores_gemma":[0.0001579388,0.00001338098,0.0002258516,0.00000744182,0.000007573666,0.000005843751,0.0003830321,0.9952368,0.002871573,0.0001343014,0.0007174131,0.000238858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007450944,0.00006735088,0.7589169,0.00001379894,0.0003107802,0.00009132229,0.000002438522,0.0008790068,0.2322675],"genre_scores_gemma":[0.08852836,0.00001092623,0.9105979,0.0001447346,0.0001143188,0.00002422203,0.000009136563,0.00003995593,0.0005304982],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.231737,"threshold_uncertainty_score":0.6818496,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03351889946306504,"score_gpt":0.2212326355300665,"score_spread":0.1877137360670015,"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."}}