{"id":"W1967030015","doi":"10.1145/1159892.1159899","title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Computer science; Approximation algorithm; Task (project management); Schedule; Mathematical optimization; Asymptotically optimal algorithm; 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.001703214,0.001262551,0.001364833,0.0008640531,0.00102278,0.001237441,0.002323602,0.001462319,0.00352226],"category_scores_gemma":[0.005520944,0.0006342754,0.0008081175,0.00194356,0.0007155018,0.00303188,0.001433341,0.001633227,0.0009377555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001883578,"about_ca_system_score_gemma":0.002409705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005049833,"about_ca_topic_score_gemma":0.006159305,"domain_scores_codex":[0.9988195,0.0002901953,0.00006718026,0.000182338,0.0003670787,0.0002736356],"domain_scores_gemma":[0.998174,0.001112217,0.000170298,0.0002994109,0.0001366116,0.0001075747],"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.0009299348,0.0002656514,0.0008984436,0.00031828,0.00009284128,0.0001635412,0.0002661131,0.7870507,0.005123532,0.02808599,0.006320035,0.1704849],"study_design_scores_gemma":[0.0001050954,0.0000748439,0.00008232451,0.00001285107,0.00001801857,0.00007086686,0.0000302249,0.9804927,0.0006465107,0.01703802,0.001420011,0.000008639156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02618391,0.0008221354,0.9676049,0.0003661939,0.00009070607,0.00009348815,0.00009176548,0.001291861,0.003455003],"genre_scores_gemma":[0.2813222,0.0006384884,0.7140204,0.0002295182,0.000105101,0.0002265629,0.0004161808,0.0002354799,0.002806069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005049833,"threshold_uncertainty_score":0.01366639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01780910403492818,"score_gpt":0.2558425173541906,"score_spread":0.2380334133192624,"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."}}