A Polynomial Time Algorithm for a Just-In-Time Scheduling Problem with Periodic Time Slots
スポンサーリンク
概要
- 論文の詳細を見る
- 北陸先端科学技術大学院大学の論文
- 2002-12-05
著者
-
Hiraishi Kunihiko
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Hiraishi Kunihiko
School Of Information Science Japan Advanced Institute Of Science And
関連論文
- Inkdot versus Pebble over Two-Dimensional Languages
- Application of DES Theory to Verification of Software Components
- Reduced State Space Generation of Concurrent Systems Using Weak Persistency (Special Section on Net Theory and Its Applications)
- Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds
- A Heuristic Algorithm for One-Machine Just-In-Time Scheduling Problem with Periodic Time Slots
- Scheduling of parallel identical machines to maximize the weighted number
- On Symbolic Model Checking in Petri Nets
- The completeness of linear logic for petri net models
- The completeness of linear logic with modal operator for Petri net models
- Construction of Rule Base for the Control of Discrete Event Dynamic
- A Polynomial Time Algorithm for a Just-In-Time Scheduling Problem with Periodic Time Slots
- AS-3-3 A Workflow-based Change Support Model for Collaborative Software Development
- KCLP-HS: a rapid prototyping tool for implementing algorithms on hybrid systems
- A Petri-Net-Based Model for the Mathematical Analysis of Multi-Agent Systems
- Application of Interval Methods to Sampled-Data Control of Uncertain Piecewise Affine Systems