{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006354214,0.00009596715,0.00008047286,0.00004017258,0.00004214486,0.00004252975,0.00008132433,0.00004549839,0.001103888],"category_scores_gemma":[0.00001106208,0.00008050067,0.00001493984,0.000120952,0.00004080814,0.0001441709,0.00000764406,0.0001031953,0.0002334485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002473947,"about_ca_system_score_gemma":0.00001597849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002115816,"about_ca_topic_score_gemma":0.000009454895,"domain_scores_codex":[0.9994922,0.000004576533,0.0001071209,0.000111406,0.0001020707,0.0001826386],"domain_scores_gemma":[0.9997391,0.00002018883,0.00001044845,0.0001203856,0.00003572127,0.00007418836],"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.000002097378,0.00000761923,0.0001645925,0.000007148454,0.0000148075,0.000001341621,0.00007216544,0.9855615,0.0001224225,0.0004391251,0.0001027377,0.01350439],"study_design_scores_gemma":[0.0003090293,0.00001430352,0.00006538836,0.00002798667,0.000005866425,0.00002324069,0.0001667844,0.9924543,0.00578928,0.000009068291,0.0009668237,0.0001678961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03992526,0.0001651074,0.8441184,0.0002234011,0.0001203195,0.0001017564,0.000002292,0.001017924,0.1143256],"genre_scores_gemma":[0.5078237,0.00001803414,0.4912685,0.00006971532,0.00006231665,0.000005310455,0.000002299856,0.00001487671,0.0007352958],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4678984,"threshold_uncertainty_score":0.9998093,"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."}}