On cyclic sequence types for constructing cyclic schedules
From MaRDI portal
Publication:3677490
Recommendations
- scientific article; zbMATH DE number 6971075
- scientific article; zbMATH DE number 4147849
- The basic cyclic scheduling problem with deadlines
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- scientific article; zbMATH DE number 850294
Cites work
- A comparison of three algorithms for finding fundamental cycles in a directed graph
- scientific article; zbMATH DE number 3648638 (Why is no real title available?)
- scientific article; zbMATH DE number 3473515 (Why is no real title available?)
- scientific article; zbMATH DE number 3635482 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3235858 (Why is no real title available?)
- On cyclic sequence types for constructing cyclic schedules
Cited in
(8)- Extensions of coloring models for scheduling purposes
- Some complexity results in cyclic scheduling
- Minimizing the number of workers in a paced mixed-model assembly line
- Line search method for solving a non-preemptive strictly periodic scheduling problem
- On cyclic sequence types for constructing cyclic schedules
- Stochastic Analysis of Cyclic Schedules
- scientific article; zbMATH DE number 7141490 (Why is no real title available?)
- The cyclic compact open-shop scheduling problem
This page was built for publication: On cyclic sequence types for constructing cyclic schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677490)