{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142122,0.0007148266,0.001675034,0.0004306008,0.0007597875,0.001081166,0.001553693,0.00086739,0.003731665],"category_scores_gemma":[0.003867903,0.0006944107,0.0003936694,0.001032652,0.0006248147,0.001390452,0.001341458,0.0007488806,0.0003606344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008197438,"about_ca_system_score_gemma":0.001346287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001538837,"about_ca_topic_score_gemma":0.002228936,"domain_scores_codex":[0.9989861,0.0004193408,0.00005352155,0.0001428365,0.0001369257,0.000261293],"domain_scores_gemma":[0.9969926,0.001613064,0.0002231615,0.0004946617,0.0003599186,0.0003165689],"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.005219787,0.0006205559,0.00112833,0.0003593117,0.00007739414,0.0003518738,0.0001577835,0.8507627,0.02049329,0.0309582,0.004393402,0.08547744],"study_design_scores_gemma":[0.00009649815,0.0001103218,0.0002545736,0.000003820844,0.00001064793,0.00002163836,0.00002071079,0.9909293,0.001740665,0.006553275,0.0002523837,0.000006197596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3562916,0.000369003,0.6329851,0.0004696457,0.0002483917,0.0001408018,0.0001949638,0.0009651316,0.00833548],"genre_scores_gemma":[0.8991991,0.00007407607,0.09771653,0.00007779559,0.00005155177,0.0001096055,0.00008935536,0.0000841702,0.002597736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003731665,"threshold_uncertainty_score":0.01248366,"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."}}