{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002509242,0.0003525268,0.0002746716,0.0002551425,0.000367449,0.0001779383,0.0003740579,0.0002556815,0.0002138487],"category_scores_gemma":[0.00001274312,0.0003892434,0.0001457609,0.0003876351,0.0001101103,0.0004856578,0.000003391567,0.0003184747,0.00005099396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001487757,"about_ca_system_score_gemma":0.0000519962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004423072,"about_ca_topic_score_gemma":0.00001408307,"domain_scores_codex":[0.9982023,0.00004087041,0.0004601922,0.0004717841,0.0003052577,0.0005196463],"domain_scores_gemma":[0.9988911,0.0001255268,0.00006266248,0.000587453,0.0001695314,0.0001637143],"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.000005461484,0.0001207978,0.000001858761,0.00001699962,0.00003829632,0.000001074625,0.00004388927,0.7200756,0.0005863109,0.0001839604,0.00002399699,0.2789018],"study_design_scores_gemma":[0.001084522,0.0001127797,0.00007303284,0.00003291586,0.00005226506,0.00002462026,0.000232754,0.9816101,0.01441245,0.00175307,0.0001479943,0.0004635361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003585701,0.00009580013,0.9929965,0.0001348713,0.000955853,0.0005532035,0.0001997658,0.001051902,0.0004264762],"genre_scores_gemma":[0.0780278,0.00004426877,0.9205118,0.00009868876,0.0003769721,0.0002752972,0.0001904168,0.0001043584,0.0003703282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2784382,"threshold_uncertainty_score":0.9998559,"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."}}