{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001905634,0.0000773495,0.0001360063,0.000409379,0.0001817973,0.001125997,0.001215425,0.00002515031,0.000001101708],"category_scores_gemma":[0.0001647465,0.00006304304,0.00004285488,0.0003536658,0.000139426,0.001206492,0.0001885848,0.00008919347,5.641243e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001797774,"about_ca_system_score_gemma":0.0004109249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005958096,"about_ca_topic_score_gemma":1.979811e-7,"domain_scores_codex":[0.9983377,0.00004161205,0.00042498,0.000203989,0.0007872813,0.000204444],"domain_scores_gemma":[0.9982962,0.0001155309,0.0002931694,0.0001163688,0.001067348,0.0001114087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004673196,0.0003462432,0.001749495,0.0001433379,0.0003158024,0.00008693783,0.002466755,0.09709685,0.07363671,0.3765946,0.001349029,0.4461675],"study_design_scores_gemma":[0.0006791825,0.00003946734,0.0001591186,0.000285706,0.000004206019,0.00007370879,0.0001448646,0.9933457,0.002036748,0.001370205,0.001787254,0.0000738025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001114,0.0003068106,0.9934095,0.001900796,0.002721248,0.0001692673,0.000003126598,0.00001533532,0.0003599883],"genre_scores_gemma":[0.6737586,0.00008096512,0.3256744,0.0002059106,0.0001238252,0.000009415971,4.929261e-7,0.000003493476,0.0001429234],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8962489,"threshold_uncertainty_score":0.999911,"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."}}