{"id":"W4410720775","doi":"10.1007/s10878-025-01325-z","title":"Improved approximation algorithms for multiprocessor indivisible coflow scheduling","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Theory of computation; Multiprocessing; Computer science; Parallel computing; Multiprocessor scheduling; Scheduling (production processes); Approximation algorithm; Algorithm; Job shop scheduling; Mathematics; Mathematical optimization; Flow shop scheduling","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.003061111,0.001436155,0.001753233,0.001283062,0.001184515,0.002225752,0.003814258,0.00174296,0.004552002],"category_scores_gemma":[0.009627281,0.0008590929,0.001072246,0.002308803,0.0008622237,0.002707842,0.001872803,0.003291208,0.0006510002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003104193,"about_ca_system_score_gemma":0.003544019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007642007,"about_ca_topic_score_gemma":0.01100846,"domain_scores_codex":[0.9984068,0.0005388504,0.00006249996,0.0002314296,0.0004068046,0.0003536083],"domain_scores_gemma":[0.9947717,0.00335531,0.0003002423,0.000729208,0.0005449362,0.0002986522],"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.0004986811,0.0002971931,0.0007634803,0.00009327172,0.00006536177,0.00005159823,0.00008828701,0.8861787,0.001328308,0.01977387,0.004223524,0.08663781],"study_design_scores_gemma":[0.00001746487,0.00001698439,0.00003779189,0.000003598757,0.000006556276,0.000007225852,0.000006331936,0.9943905,0.0001623563,0.005126783,0.0002219732,0.000002411961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03834818,0.0007649038,0.9533171,0.000554696,0.0002738465,0.0001001464,0.0001173128,0.0009140882,0.005609798],"genre_scores_gemma":[0.4848824,0.0003870521,0.5090671,0.0002676177,0.000204596,0.0002401038,0.0003828373,0.0002753331,0.004293029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007642007,"threshold_uncertainty_score":0.02252263,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01377865010263728,"score_gpt":0.2715178212744539,"score_spread":0.2577391711718166,"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."}}