{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416048,0.0001209886,0.0002744863,0.0002765639,0.0002428184,0.0001118252,0.001111839,0.00006274037,0.00004216176],"category_scores_gemma":[0.0003457642,0.00008322483,0.0001585563,0.0005272298,0.00007748496,0.0009674386,0.0001939533,0.0004513056,0.000006796139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003676957,"about_ca_system_score_gemma":0.0002949557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007410365,"about_ca_topic_score_gemma":0.000001556585,"domain_scores_codex":[0.9980427,0.0001373481,0.0007301011,0.0001546176,0.000667268,0.0002679352],"domain_scores_gemma":[0.9981403,0.0002286992,0.0005844627,0.0003330497,0.0005784594,0.0001349676],"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.00007525049,0.0003979599,0.01517489,0.0001463936,0.0002899961,0.0002565047,0.02346751,0.8702514,0.02413927,0.02117064,0.0005240524,0.04410611],"study_design_scores_gemma":[0.0008255773,0.0002034603,0.0006900322,0.0003483991,0.00001535362,0.0003832789,0.0004248599,0.9865844,0.006615984,0.003169532,0.0005581217,0.0001809908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4903757,0.0008968729,0.5056987,0.002167827,0.000325027,0.00008319595,4.000233e-7,0.00002256563,0.0004296904],"genre_scores_gemma":[0.5612274,0.000214593,0.4382969,0.0001091703,0.0001151641,6.664624e-7,1.608192e-7,0.000006929386,0.00002904584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.116333,"threshold_uncertainty_score":0.339381,"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."}}