{"id":"W2097714267","doi":"10.1109/robot.1991.131794","title":"Resource allocation in a flexible manufacturing system by graph matching","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Graph; Flexible manufacturing system; Resource allocation; Blossom algorithm; Distributed computing; Cardinality (data modeling); Theoretical computer science; Mathematical optimization; Data mining; Mathematics; Computer network; Scheduling (production processes)","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":[],"consensus_categories":[],"category_scores_codex":[0.00008755615,0.00008588286,0.00008357929,0.000115151,0.00003340754,0.00004073364,0.00007302158,0.00005239078,0.00008951093],"category_scores_gemma":[0.000002614202,0.00008827028,0.00001996513,0.0001391764,0.000004525665,0.0000881762,0.000007848255,0.00009578373,0.00007995633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006206257,"about_ca_system_score_gemma":7.873498e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003417399,"about_ca_topic_score_gemma":0.000004389889,"domain_scores_codex":[0.9994717,0.00001209773,0.0001625728,0.0001083937,0.00009343019,0.0001517812],"domain_scores_gemma":[0.9998063,0.00001850405,0.00001269516,0.0001163278,0.00000570122,0.00004043076],"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":[7.0139e-7,0.000008446773,0.00002910317,0.00005368574,0.000006574816,0.000001753071,0.0003565103,0.9946576,0.0002033103,0.0002279363,0.001440629,0.00301371],"study_design_scores_gemma":[0.0002636875,0.000004356838,0.00004680398,0.00006517477,0.000003134116,0.000006827297,0.0007846146,0.9816913,0.01593954,0.00002990963,0.000999367,0.0001652569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170763,0.0008929162,0.740653,0.0002145988,0.0002879196,0.000210713,0.000003202497,0.002639734,0.08433484],"genre_scores_gemma":[0.9757454,0.00002600691,0.02283876,0.00004312298,0.00003163068,0.00001315139,0.00000911921,0.00002636579,0.001266488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8049823,"threshold_uncertainty_score":0.3599558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009402348641347362,"score_gpt":0.1897180229863262,"score_spread":0.1803156743449788,"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."}}