{"id":"W2002707982","doi":"10.1016/j.ipl.2004.09.003","title":"Optimal preemptive semi-online scheduling on two uniform processors","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Preemption; Parallel computing; Upper and lower bounds; Fair-share scheduling; Mathematical optimization; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001512806,0.0002431981,0.0001604074,0.0002940409,0.0002052579,0.0002508278,0.0001924869,0.00008475529,0.00001409725],"category_scores_gemma":[0.00005737409,0.0002411899,0.00004750065,0.0004859544,0.00004926681,0.002084718,0.00002041221,0.0003309606,0.0001316484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002106915,"about_ca_system_score_gemma":0.00007060577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004575419,"about_ca_topic_score_gemma":0.000001029143,"domain_scores_codex":[0.9987089,0.000006375713,0.0004431085,0.000133377,0.0003426033,0.0003656282],"domain_scores_gemma":[0.9994692,0.0000173011,0.0001265568,0.0001463807,0.0001393533,0.0001012479],"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.00001341039,0.00001832567,0.00003103104,0.0001197089,0.0000146169,0.000001451448,0.002473055,0.9862347,0.0001378796,0.00006037599,0.00003017335,0.0108653],"study_design_scores_gemma":[0.00157647,0.00003933393,0.0001156404,0.0003610573,0.00001714175,0.00002006432,0.0009934425,0.988843,0.007060302,0.00004328564,0.0004913285,0.0004389079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4542188,0.00004064654,0.5420766,0.0009151699,0.0002520857,0.0001766279,0.00001475412,0.0009879478,0.001317384],"genre_scores_gemma":[0.7745441,0.00001071413,0.2224699,0.002564374,0.0001563839,0.00002939682,0.0001778077,0.00003587397,0.00001143342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3203253,"threshold_uncertainty_score":0.9835439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009031892342331585,"score_gpt":0.230946689564967,"score_spread":0.2219147972226354,"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."}}