- Tytuł:
- Cyclic processes scheduling
- Autorzy:
-
Bocewicz, G.
Banaszak, Z. - Powiązania:
- https://bibliotekanauki.pl/articles/117827.pdf
- Data publikacji:
- 2010
- Wydawca:
- Polskie Towarzystwo Promocji Wiedzy
- Tematy:
-
cyclic processes
cyclic scheduling
time-table
periodicity
periodic timetables
dispatching rule - Opis:
- In everyday practice cyclic scheduling problems, especially timetabling ones arise in different application and service domains, e.g., class, train, crew timetabling, and so on. In many cases, e.g., caused by assumed slot size, imposing integer domain results in Diophantine character of problems considered. In that context some classes of cyclic scheduling problems can be seen as non-decidable (undecidable) ones. That means, since system constraints (i.e., parameter domains) determine its behavior (e.g., the space of feasible schedules), hence both system structure configuration and desired schedule have to be considered simultaneously. So, cyclic scheduling problem solution requires that the system structure configuration must be determined for the purpose of processes scheduling, yet scheduling must be done to devise the system configuration. In that context, this contribution provides discussion of some solubility issues concerning cyclic processes dispatching problems.
- Źródło:
-
Applied Computer Science; 2010, 6, 2; 41-70
1895-3735 - Pojawia się w:
- Applied Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł