The basic cyclic scheduling problem with linear precedence constraints

DOI10.1016/0166-218X(94)00126-XzbMath0848.90070OpenAlexW2045136239MaRDI QIDQ1917250

Yanyan Li

Publication date: 24 October 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00126-x

zbMATH Keywords

precedence constraintgeneric tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints, A robust basic cyclic scheduling problem, Periodic schedules for linear precedence constraints, Minimizing place capacities of weighted event graphs for enforcing liveness

Cites Work

• The basic cyclic scheduling problem with deadlines
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• Unnamed Item
• Unnamed Item