{"id":"W4417507764","doi":"10.1080/00207721.2025.2602076","title":"Approximate message passing algorithm for decentralised task assignment and scheduling","year":2025,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Gyeonggi-do Regional Research Center; National Research Foundation of Korea","keywords":"Scheduling (production processes); Message passing; Task (project management); Job shop scheduling; Fair-share scheduling; Rate-monotonic scheduling","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.001438931,0.0008941001,0.001267101,0.000768152,0.0008178665,0.0009049187,0.001693945,0.0008054099,0.002467793],"category_scores_gemma":[0.002916593,0.0004175505,0.0006661031,0.001064901,0.000712224,0.001342142,0.001144276,0.001321749,0.0006293079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009989472,"about_ca_system_score_gemma":0.001895307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005609571,"about_ca_topic_score_gemma":0.005125095,"domain_scores_codex":[0.9991067,0.0003040851,0.00005138537,0.0001603633,0.0002416686,0.0001358327],"domain_scores_gemma":[0.999047,0.000383784,0.0001421586,0.000189165,0.0001711643,0.00006670094],"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.0001451172,0.00004688518,0.0003768446,0.00007340426,0.00004104034,0.00004467156,0.0001208232,0.8962855,0.002404454,0.02099483,0.001732345,0.07773395],"study_design_scores_gemma":[0.00002217096,0.00003272053,0.00006105863,0.000003454324,0.000007418372,0.00001760455,0.000009960648,0.9911656,0.0005923584,0.006748276,0.001334329,0.000005077363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004254182,0.00008785466,0.9944053,0.00005828899,0.00002168659,0.00003138963,0.00001556929,0.0003394581,0.0007863388],"genre_scores_gemma":[0.3674146,0.0002685329,0.6275603,0.0001010443,0.00006299646,0.000375184,0.0001975307,0.00012397,0.003895941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005609571,"threshold_uncertainty_score":0.01115382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01732953082634017,"score_gpt":0.3076323307883267,"score_spread":0.2903027999619865,"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."}}