{"id":"W1980770949","doi":"10.1109/mis.2005.9","title":"Holonic Job Shop Scheduling Using a Multiagent System","year":2005,"lang":"en","type":"article","venue":"IEEE Intelligent Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Job shop scheduling; Flow shop scheduling; Heuristics; Job shop; Scheduling (production processes); Distributed computing; Two-level scheduling; Dynamic priority scheduling; Fair-share scheduling; Schedule; Job scheduler; Multi-agent system; Rate-monotonic scheduling; Industrial engineering; Operations research; Artificial intelligence; Mathematical optimization; Engineering; Operating system; Cloud computing","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.0003841041,0.0003090495,0.000361249,0.0002292869,0.0001290303,0.0001698303,0.0002640785,0.000187795,0.00003541896],"category_scores_gemma":[0.00002093822,0.000312518,0.0001368483,0.0003031789,0.00002609202,0.0001649246,0.00001942151,0.0002544526,0.0007300004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006282831,"about_ca_system_score_gemma":0.0000328829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006357343,"about_ca_topic_score_gemma":0.000005659593,"domain_scores_codex":[0.9980964,0.00006288412,0.0007075706,0.0003161141,0.0003418503,0.0004751935],"domain_scores_gemma":[0.9991269,0.00005765062,0.00009011778,0.0004079331,0.0001192471,0.0001982133],"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.000003458574,0.00001627618,0.0001435617,0.0002140342,0.00008034924,0.0000121008,0.0003719695,0.9964589,0.00137429,0.0001439148,0.00008754882,0.001093591],"study_design_scores_gemma":[0.0001870482,0.00001195926,0.000005129416,0.0004170377,0.00003498391,0.00011272,0.001081768,0.9866059,0.009767569,4.476055e-7,0.001434194,0.0003412865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2939431,0.003794755,0.694037,0.00001436723,0.00547134,0.0004078622,0.000008675115,0.001248696,0.001074208],"genre_scores_gemma":[0.9641739,0.00007968879,0.03396357,0.00001746058,0.001311335,0.00004331818,0.000005401928,0.00009974519,0.0003056342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6702307,"threshold_uncertainty_score":0.9999327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03513908537422933,"score_gpt":0.2622185049109972,"score_spread":0.2270794195367679,"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."}}