On cyclic sequence types for constructing cyclic schedules

DOI10.1007/BF01920492zbMath0563.90057OpenAlexW2044464197MaRDI QIDQ3677490

Heinz D. Modrow, Alexander Neumann, Wolfgang Dauscha

Publication date: 1985

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01920492

zbMATH Keywords

traffic controlproject planningtask systemscyclic sequence typesexistence criterion for cyclic schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (7)

Some complexity results in cyclic scheduling ⋮ Unnamed Item ⋮ Line search method for solving a non-preemptive strictly periodic scheduling problem ⋮ Minimizing the number of workers in a paced mixed-model assembly line ⋮ The cyclic compact open-shop scheduling problem ⋮ Extensions of coloring models for scheduling purposes ⋮ On cyclic sequence types for constructing cyclic schedules

Cites Work

• On cyclic sequence types for constructing cyclic schedules
• A comparison of three algorithms for finding fundamental cycles in a directed graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On cyclic sequence types for constructing cyclic schedules