{"id":"W2101083305","doi":"10.1007/s10951-008-0078-4","title":"Minimizing the stretch when scheduling flows of divisible requests","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Heuristics; Computer science; Preemption; Scheduling (production processes); Mathematical optimization; Pareto principle; Linear programming; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661243,0.0008588777,0.001291618,0.0007638558,0.001201752,0.001601209,0.001097366,0.0009234678,0.002544028],"category_scores_gemma":[0.006377337,0.0006927146,0.0004272224,0.001116088,0.0006512282,0.002253022,0.001368352,0.001025013,0.000138695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00151151,"about_ca_system_score_gemma":0.0009849656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002780468,"about_ca_topic_score_gemma":0.003690499,"domain_scores_codex":[0.9992513,0.0002122483,0.00003961214,0.0001100466,0.0001779548,0.0002086986],"domain_scores_gemma":[0.9972397,0.001700713,0.0003092329,0.0001717255,0.0001829917,0.0003957342],"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.002258762,0.0002668034,0.003175329,0.000265498,0.00006851751,0.0003577248,0.0003393068,0.8756825,0.01502322,0.01019101,0.002082861,0.09028838],"study_design_scores_gemma":[0.00004029988,0.0002776062,0.0007992674,0.0000137799,0.00001838958,0.00005990885,0.0001702192,0.9855933,0.002912795,0.00949055,0.0006116405,0.00001225865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7716791,0.0007650712,0.2183084,0.000791333,0.0002556945,0.0002432266,0.0002111204,0.0004747697,0.00727126],"genre_scores_gemma":[0.9632283,0.0001757289,0.03358136,0.00006130375,0.00007354275,0.00004733573,0.00009474557,0.0001038047,0.002633881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002780468,"threshold_uncertainty_score":0.01096684,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04646876579966042,"score_gpt":0.2742331595174468,"score_spread":0.2277643937177863,"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."}}