Search the dblp DataBase

Publications of Author

1. J. Carlier, Philippe Chrétienne
   Timed Petri net schedules. [Citation Graph (0, 0)][DBLP]
   European Workshop on Applications and Theory of Petri Nets, 1987, pp:62-84 [Conf]
   
2. J. Carlier, Philippe Chrétienne, Claude Girault
   Modelling scheduling problems with timed Petri nets. [Citation Graph (0, 0)][DBLP]
   European Workshop on Applications and Theory in Petri Nets, 1984, pp:62-82 [Conf]
   
3. D. Quichaud, Philippe Chrétienne
   Performance Evaluation of Interpreted Bipolar Synchronization Schemes Using G. E. R. T.. [Citation Graph (0, 0)][DBLP]
   European Workshop on Applications and Theory of Petri Nets, 1987, pp:343-370 [Conf]
   
4. Philippe Chrétienne, Françoise Lamour
   Mapping Graphs onto a Partially Reconfigurable Architecture. [Citation Graph (0, 0)][DBLP]
   EDMCC, 1991, pp:73-79 [Conf]
   
5. Jean-Yves Colin, Philippe Chrétienne
   Grain Size and Communication Channels on Distributed Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
   PARCO, 1993, pp:281-286 [Conf]
   
6. Philippe Chrétienne
   Timed Event Graphs: A Complete Study of Their Controlled Executions. [Citation Graph (0, 0)][DBLP]
   PNPM, 1985, pp:47-54 [Conf]
   
7. Philippe Chrétienne
   Tree Scheduling with Communication Delays. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:129-141 [Journal]
   
8. Philippe Chrétienne
   List Schedules for Cyclic Scheduling. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:141-159 [Journal]
   
9. Philippe Chrétienne
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:15, pp:2041-2042 [Journal]
   
10. Philippe Chrétienne
    Timed petri nets: A solution to the minimum-time-reachability problem between two states of a timed-event graph. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1986, v:6, n:1-2, pp:95-101 [Journal]
    
11. Anne M. Landraud, Jean-François Avril, Philippe Chrétienne
    An Algorithm for Finding a Common Structure Shared by a Family of Strings. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1989, v:11, n:8, pp:890-895 [Journal]
    
12. Philippe Chrétienne
    On Graham's bound for cyclic scheduling. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:9, pp:1163-1174 [Journal]
    
13. Philippe Chrétienne, Francis Sourd
    PERT scheduling with convex cost functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:145-164 [Journal]
    
14. Philippe Chrétienne
    Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003). [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:168, n:2, pp:658-661 [Journal]
    
15. Ethel Mokotoff, Philippe Chrétienne
    A cutting plane algorithm for the unrelated parallel machine scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:3, pp:515-525 [Journal]
    
16. 
    On single-machine scheduling without intermediate delays. [Citation Graph (, )][DBLP]
    
    
17. 
    The basic cyclic scheduling problem with deadlines. [Citation Graph (, )][DBLP]
    
    
18. 
    On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. [Citation Graph (, )][DBLP]