{"id":"W2162193020","doi":"10.1109/ipdps.2001.925215","title":"On preemption redundancy in scheduling unit processing time jobs on two parallel machines","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Conjecture; Counterexample; Redundancy (engineering); Parallel computing; Processor scheduling; Schedule; Algorithm; Combinatorics; Mathematics; Mathematical optimization; Operating system","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.0001456047,0.0001725511,0.0001406543,0.0002078402,0.00006293201,0.00006891605,0.0001012095,0.00007567959,0.0002902303],"category_scores_gemma":[0.00004090353,0.0001622289,0.00003087913,0.0002761233,0.00001222346,0.000186811,0.000009975791,0.0002372926,0.0004858636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006860054,"about_ca_system_score_gemma":0.00001518576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008907127,"about_ca_topic_score_gemma":0.00002222179,"domain_scores_codex":[0.9991511,0.00002129724,0.0002402285,0.0001959453,0.0001636718,0.00022772],"domain_scores_gemma":[0.99969,0.00004172709,0.00002749788,0.0001496912,0.00002929259,0.00006177304],"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.00001569751,0.00004259091,0.0002625509,0.00001574585,0.000004803737,0.000001439226,0.0001342038,0.9601137,0.0001432309,0.0004188258,0.00003729811,0.03880993],"study_design_scores_gemma":[0.0007091112,0.00002951364,0.0006970013,0.0001462104,0.00000385413,0.000002521769,0.00001691496,0.9973342,0.0005675668,0.0001823949,0.0001095042,0.0002012032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8072394,0.0004117786,0.1391433,0.0006861815,0.0002660856,0.0003364946,0.000003122989,0.001635727,0.05027786],"genre_scores_gemma":[0.7619411,0.00002326562,0.2359542,0.000200534,0.000214663,0.00001758768,0.00002177835,0.00004964579,0.001577149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09681088,"threshold_uncertainty_score":0.6615503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01301072878011412,"score_gpt":0.2557463854126288,"score_spread":0.2427356566325147,"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."}}