The basic cyclic scheduling problem with linear precedence constraints

Discrete Applied Mathematics

Volumn 64, Issue 3, 1996, Pages 219-238

  Munier, A ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004042256     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00126-X     Document Type: Article

References (6)

1. P. Chrétienne, Les réseaux de Petri temporisés, Thèse d'état, Université P. et M. Curie (1983).
2. P. Chrétienne, The basic cyclic schedule problem with deadlines, Discrete Appl. Math. 30 (1991) 109-123.
3. G. Cohen, P. Moller, J.P. Quadrat and M. Viot, Algebraic tools for the performance evaluation of discrete event systems, in: IEEE Proceedings on Discrete Event Dynamics Systems (1989).
4. G.B. Dantzig, W. Blattner and M.R. Rao, Finding a Cycle in a Graph with Minimum Cost to Time Ratio with Application to a Ship Routing Problem (Gordon and Breach, New York, 1967) 77-84.
5. C. Hanen and A. Munier, Cyclic scheduling on parallel processors: an overview, LRI internal report, Université Paris-sud, Paris (1993).
6. A. Munier, Contribution à l'étude des ordonnancements cycliques, Thèse d'université, Université P. et M. Curie (1991).