Sequence Planning for Labeled Petri Nets With Time and Resource Constraints Using Basis Markings
This paper addresses the scheduling problem for discrete event systems modeled by labeled Petri nets with time and resource constraints where deadlocks are inevitable. For better resource utilization and shorter processing time, a heuristic algorithm is presented for designing a suitable transition...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
IEEE
2023-01-01
|
| Серія: | IEEE Access |
| Предмети: | |
| Онлайн доступ: | https://ieeexplore.ieee.org/document/10272588/ |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|