{"id":"W1964122413","doi":"10.1016/j.jcss.2011.04.003","title":"Scheduling malleable tasks with precedence constraints","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Royal Bank of Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Rounding; Speedup; Approximation algorithm; Regular polygon; Mathematical optimization; Algorithm; Parallel computing; 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":[],"consensus_categories":[],"category_scores_codex":[0.0004376471,0.00006692664,0.0001375916,0.00009101089,0.00008095688,0.0000829491,0.0001457517,0.00002330921,0.00001054048],"category_scores_gemma":[0.00000287474,0.00004354389,0.00001954201,0.0001373858,0.0001249569,0.000233804,0.00001038502,0.00007472668,0.000001976062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009948612,"about_ca_system_score_gemma":0.00003305694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001584546,"about_ca_topic_score_gemma":4.179053e-7,"domain_scores_codex":[0.999413,0.00001822626,0.000212257,0.00006849087,0.0001782652,0.0001097211],"domain_scores_gemma":[0.99969,0.00002781304,0.00008055523,0.00004135566,0.00008352417,0.00007676613],"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.00002643097,0.00003638741,0.01194129,0.0002732176,0.0001269324,0.00009932848,0.004930445,0.9486831,0.00009771038,0.00381447,0.0001083402,0.02986235],"study_design_scores_gemma":[0.0003230925,0.0002733552,0.001377356,0.0004970774,0.00001369843,0.001356686,0.001638597,0.993973,0.0003785021,0.00002608042,0.00001851837,0.0001240799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2028351,0.0004361459,0.790556,0.00001153462,0.0005730332,0.00003624918,4.427172e-7,0.00004261131,0.00550893],"genre_scores_gemma":[0.6664676,0.00001354158,0.3334344,0.000006821565,0.00007002534,2.540938e-7,2.36627e-8,0.000002631461,0.000004738635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4636326,"threshold_uncertainty_score":0.1775668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02568153275759406,"score_gpt":0.2140011848186803,"score_spread":0.1883196520610862,"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."}}