{"id":"W2947858290","doi":"10.1109/tase.2019.2908762","title":"Solving the Tree-Structured Task Allocation Problem via Group Multirole Assignment","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University","funders":"Science and Technology Planning Project of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Task (project management); Assignment problem; Tree (set theory); Computer science; Mathematical optimization; Resource allocation; Generalized assignment problem; Optimization problem; Mathematics; Algorithm; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.002047162,0.001085688,0.0009445515,0.0009007083,0.0009439709,0.001122012,0.00107976,0.001055342,0.005773783],"category_scores_gemma":[0.004066946,0.0004896491,0.001277692,0.0014249,0.0006836571,0.00212022,0.001278806,0.001359115,0.0009153499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006895924,"about_ca_system_score_gemma":0.002350528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002692009,"about_ca_topic_score_gemma":0.003158602,"domain_scores_codex":[0.9978858,0.001100206,0.000088074,0.0003229202,0.0003465604,0.0002565527],"domain_scores_gemma":[0.9980703,0.001185333,0.000231723,0.0001518158,0.0002327449,0.0001281134],"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.0002071127,0.0003015298,0.001441384,0.0007039628,0.00009289406,0.0004882191,0.000654445,0.7252352,0.007924431,0.07014765,0.008489424,0.1843137],"study_design_scores_gemma":[0.00004871625,0.0002584496,0.0003801193,0.00005386959,0.00003081995,0.0002488286,0.0003552069,0.9316936,0.0019252,0.05712275,0.007857,0.00002544197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01083033,0.000129002,0.9854003,0.0001796376,0.00003214355,0.0001366563,0.00005444543,0.0001428922,0.003094708],"genre_scores_gemma":[0.2428215,0.0004731661,0.7525467,0.0001301413,0.00006047366,0.0004645074,0.0003275182,0.0001174818,0.003058571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005773783,"threshold_uncertainty_score":0.01931524,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005509376641724048,"score_gpt":0.1933676508352533,"score_spread":0.1878582741935293,"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."}}