{"id":"W1665195048","doi":"10.1109/robot.1998.677427","title":"An efficient search algorithm for deadlock-free scheduling in FMS using Petri nets","year":2002,"lang":"en","type":"article","venue":"","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Petri net; Computer science; Deadlock; Scheduling (production processes); Branch and bound; Algorithm; Stochastic Petri net; Truncation (statistics); Job shop scheduling; Mathematical optimization; Theoretical computer science; Distributed computing; Mathematics; Routing (electronic design automation)","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.001225557,0.0001980845,0.000257959,0.0004825374,0.0001965544,0.0003216846,0.001863294,0.0001088249,0.00001919534],"category_scores_gemma":[0.00008173709,0.0001929967,0.000075895,0.00109951,0.0000302052,0.0004353891,0.0004218757,0.0001933796,0.00002477581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002422204,"about_ca_system_score_gemma":0.00006078658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001596079,"about_ca_topic_score_gemma":0.00001957267,"domain_scores_codex":[0.9973882,0.0001133669,0.000459146,0.0007196944,0.0005875552,0.0007319779],"domain_scores_gemma":[0.9981964,0.0001938913,0.00006827073,0.001191578,0.0001687043,0.000181117],"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.000001878005,0.000162622,0.0001705178,0.00001832469,0.000006896568,0.00002842764,0.0008516747,0.881694,0.0006681579,0.002589945,0.00004695801,0.1137606],"study_design_scores_gemma":[0.0007988308,0.00007240359,0.00003414444,0.00005721495,0.000002304728,0.00005214263,0.0001019979,0.9972358,0.001148348,0.0001672802,0.00007872384,0.0002507476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1633768,0.0003013157,0.8347403,0.0001336351,0.0003997032,0.0003508224,0.000002923289,0.0001786217,0.0005157936],"genre_scores_gemma":[0.4397857,0.000002262302,0.5599585,0.00008381856,0.00008615754,0.00001066364,6.227993e-7,0.00001402085,0.00005825257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2764089,"threshold_uncertainty_score":0.7870175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07815853048841134,"score_gpt":0.3124619328383274,"score_spread":0.2343034023499161,"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."}}