{"id":"W1986491739","doi":"10.1016/j.disopt.2008.09.001","title":"Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi; Memorial University of Newfoundland","funders":"","keywords":"Divide and conquer algorithms; Computer science; Scheduling (production processes); Parallel computing; Conjecture; Schedule; Class (philosophy); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Mathematical optimization","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.0002243109,0.0002093932,0.0002784552,0.0001466781,0.0001442275,0.00003559324,0.0001150865,0.000138724,0.00002772377],"category_scores_gemma":[0.0002341649,0.0002065567,0.00009089785,0.0002668825,0.0001041444,0.000242518,0.00002189626,0.0001195725,0.000003089818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002373756,"about_ca_system_score_gemma":0.00002349096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003986732,"about_ca_topic_score_gemma":6.990094e-7,"domain_scores_codex":[0.9987555,0.00002723443,0.0004675286,0.0002728876,0.0002319596,0.0002449314],"domain_scores_gemma":[0.9993358,0.00009465736,0.0001008451,0.0001970002,0.0001675016,0.0001042309],"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.00004652612,0.00002680394,0.0006013679,0.0001004343,0.00004435323,0.00000112385,0.000282707,0.9967763,0.00003524984,0.001754703,0.00004849553,0.000281923],"study_design_scores_gemma":[0.0008058599,0.00006731578,0.0003681399,0.00006238395,0.00003868281,0.000006660208,0.00005080805,0.9972374,0.0007005297,0.0003962058,0.00002173854,0.0002442661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03495982,0.000213156,0.9632294,0.0001314945,0.000174764,0.0004646277,0.00003770839,0.0002287003,0.0005602943],"genre_scores_gemma":[0.5654709,0.0002470952,0.433852,0.00004349603,0.00004917876,0.00008272401,0.0001605443,0.00004527095,0.00004883275],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5305111,"threshold_uncertainty_score":0.8423138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01772737265669138,"score_gpt":0.2472389947255821,"score_spread":0.2295116220688907,"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."}}