{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009784438,0.0001293424,0.0002882614,0.0002703976,0.0001709757,0.0003438704,0.0006241499,0.0001169774,0.0000010497],"category_scores_gemma":[0.000402366,0.000120085,0.0001217022,0.0006537189,0.00001415946,0.0007186515,0.00006573111,0.0001461195,5.749177e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000911196,"about_ca_system_score_gemma":0.0003302056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002334609,"about_ca_topic_score_gemma":4.027252e-8,"domain_scores_codex":[0.998646,0.00007181501,0.0006652105,0.0001757842,0.0002546533,0.0001865406],"domain_scores_gemma":[0.9977416,0.0001873752,0.0007119664,0.0001825505,0.001115047,0.00006142443],"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.00007217603,0.0001783638,0.00008550534,0.0001114728,0.00007467463,0.000001080323,0.0002413461,0.9546409,0.0002505737,0.03752459,0.0004148883,0.006404418],"study_design_scores_gemma":[0.002797219,0.0001977796,0.00002031635,0.0001370037,0.00002281494,0.000005974637,0.00002076303,0.987092,0.001175947,0.007560695,0.0008557679,0.0001136768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009081725,0.0001498773,0.990761,0.0003648977,0.007261889,0.0003259924,0.00000278184,0.00005454365,0.0001708003],"genre_scores_gemma":[0.3928092,0.000009652757,0.6067004,0.00004905262,0.0003578049,0.000009744731,0.00001288729,0.000007581862,0.0000437036],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.391901,"threshold_uncertainty_score":0.4896924,"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."}}