{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863104,0.0008669003,0.00171287,0.001288366,0.0008382002,0.001342445,0.001084353,0.001134214,0.006411553],"category_scores_gemma":[0.009612884,0.0005010854,0.0004859362,0.0009535749,0.001072735,0.00182297,0.00108315,0.00118441,0.000539868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002136436,"about_ca_system_score_gemma":0.003425858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0104716,"about_ca_topic_score_gemma":0.01067612,"domain_scores_codex":[0.9987887,0.000428928,0.00005308285,0.0001438686,0.0002223426,0.0003631809],"domain_scores_gemma":[0.9958476,0.003058617,0.0002186213,0.0003083411,0.0003523243,0.000214422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006377224,0.000167139,0.0005748511,0.0001626385,0.00002646295,0.00003288007,0.00008398919,0.9266247,0.002375712,0.01833184,0.004227785,0.04675438],"study_design_scores_gemma":[0.00003910676,0.00006313687,0.0001969244,0.000007433459,0.000005838017,0.000005931084,0.00002605057,0.9881731,0.0005690923,0.01065081,0.0002586312,0.000003966005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1783005,0.0009743168,0.7926099,0.001282894,0.0002142219,0.0003583882,0.0007134335,0.001213268,0.02433309],"genre_scores_gemma":[0.8472618,0.0003343152,0.1455045,0.0002895987,0.0001292025,0.0002422213,0.0006791503,0.0003638858,0.005195285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0104716,"threshold_uncertainty_score":0.02144879,"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."}}