{"id":"W2081840458","doi":"10.1145/1073970.1073983","title":"Scheduling malleable tasks with precedence constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Computer science; Scheduling (production processes); Speedup; Parallel computing; Approximation algorithm; Allotment; Mathematical optimization; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000763097,0.0007588223,0.0009305993,0.0004698345,0.000782543,0.000827622,0.001397771,0.0007456178,0.002666681],"category_scores_gemma":[0.002681487,0.0004670677,0.000558587,0.0008256512,0.0005581096,0.001395009,0.0008145537,0.001233939,0.0005193363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195452,"about_ca_system_score_gemma":0.001751116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005691574,"about_ca_topic_score_gemma":0.005750481,"domain_scores_codex":[0.9993973,0.0001289565,0.0000319077,0.0001059205,0.0001991426,0.000136763],"domain_scores_gemma":[0.9990464,0.0005331431,0.00009738914,0.0001456684,0.00009583301,0.00008152741],"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.0004065259,0.0001196744,0.0005868674,0.0001608999,0.00003961984,0.0001578215,0.000185696,0.8753583,0.006103035,0.02196825,0.002136898,0.09277633],"study_design_scores_gemma":[0.00002621807,0.00003340409,0.00005550137,0.000005041868,0.000004690118,0.00003004432,0.00001859911,0.9905323,0.0007559367,0.007339448,0.001193731,0.000005022413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03010058,0.0003238328,0.9669712,0.0001868463,0.00006844464,0.00005393498,0.00004124684,0.0004645291,0.001789342],"genre_scores_gemma":[0.4293862,0.0004344224,0.5656009,0.0001713543,0.00008994371,0.0001328341,0.0002351008,0.0001822932,0.003767049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005691574,"threshold_uncertainty_score":0.0113169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01006192503125756,"score_gpt":0.2120432341109385,"score_spread":0.201981309079681,"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."}}