{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007966544,0.0008608244,0.0007978809,0.0009710371,0.0005949243,0.0005936389,0.0007759376,0.0008506548,0.003184728],"category_scores_gemma":[0.001635274,0.0004899349,0.0005961608,0.0008469042,0.0006381639,0.001115963,0.000678141,0.0006107134,0.0005429123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008911612,"about_ca_system_score_gemma":0.001812571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003780257,"about_ca_topic_score_gemma":0.003422068,"domain_scores_codex":[0.9996893,0.00009745934,0.0000242933,0.0000618711,0.00007844345,0.000048654],"domain_scores_gemma":[0.9994692,0.0003994161,0.00003504169,0.0000231259,0.00005592805,0.00001739741],"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.0002539621,0.00009385376,0.000416277,0.0002615034,0.00005285214,0.0001275529,0.0001231143,0.5960921,0.01480445,0.03605693,0.003183302,0.3485341],"study_design_scores_gemma":[0.00007087186,0.00006374268,0.00006258077,0.00001665822,0.00001429815,0.00004391302,0.00001822174,0.982165,0.00257943,0.01333198,0.001621943,0.00001131377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006394712,0.0001258679,0.9916659,0.00003924128,0.00001390922,0.0000505586,0.00003148423,0.0007200709,0.0009582773],"genre_scores_gemma":[0.08277894,0.0001303408,0.915738,0.00003516599,0.000009366528,0.0001797413,0.0001264349,0.0000940069,0.0009080367],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003780257,"threshold_uncertainty_score":0.01065403,"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."}}