 | 2008 |
|---|
| 19 |       | Philippe Chrétienne:
On single-machine scheduling without intermediate delays.
Discrete Applied Mathematics 156(13): 2543-2550 (2008) |
| 18 | | B. Vatinlen,
F. Chauvet,
Philippe Chrétienne,
P. Mahey:
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.
European Journal of Operational Research 185(3): 1390-1401 (2008) |
| 2007 |
|---|
| 17 | | Nathalie Faure,
Philippe Chrétienne,
Éric Gourdin,
Francis Sourd:
Biclique completion problems for multicast network design.
Discrete Optimization 4(3-4): 360-377 (2007) |
| 2006 |
|---|
| 16 | | Philippe Chrétienne:
Preface.
Discrete Applied Mathematics 154(15): 2041-2042 (2006) |
| 15 | | Philippe Chrétienne:
Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003).
European Journal of Operational Research 168(2): 658-661 (2006) |
| 2003 |
|---|
| 14 |  | Philippe Chrétienne,
Francis Sourd:
PERT scheduling with convex cost functions.
Theor. Comput. Sci. 292(1): 145-164 (2003) |
| 2002 |
|---|
| 13 | | Ethel Mokotoff,
Philippe Chrétienne:
A cutting plane algorithm for the unrelated parallel machine scheduling problem.
European Journal of Operational Research 141(3): 515-525 (2002) |
| 2000 |
|---|
| 12 | | Philippe Chrétienne:
On Graham's bound for cyclic scheduling.
Parallel Computing 26(9): 1163-1174 (2000) |
| 1999 |
|---|
| 11 | | Philippe Chrétienne:
List Schedules for Cyclic Scheduling.
Discrete Applied Mathematics 94(1-3): 141-159 (1999) |
| 1994 |
|---|
| 10 | | Philippe Chrétienne:
Tree Scheduling with Communication Delays.
Discrete Applied Mathematics 49(1-3): 129-141 (1994) |
| 1993 |
|---|
| 9 | | Jean-Yves Colin,
Philippe Chrétienne:
Grain Size and Communication Channels on Distributed Memory Multiprocessors.
PARCO 1993: 281-286 |
| 1991 |
|---|
| 8 | | Philippe Chrétienne,
Françoise Lamour:
Mapping Graphs onto a Partially Reconfigurable Architecture.
EDMCC 1991: 73-79 |
| 7 | | Philippe Chrétienne:
The basic cyclic scheduling problem with deadlines.
Discrete Applied Mathematics 30(2-3): 109-123 (1991) |
| 1989 |
|---|
| 6 | | Anne M. Landraud,
Jean-François Avril,
Philippe Chrétienne:
An Algorithm for Finding a Common Structure Shared by a Family of Strings.
IEEE Trans. Pattern Anal. Mach. Intell. 11(8): 890-895 (1989) |
| 1987 |
|---|
| 5 | | D. Quichaud,
Philippe Chrétienne:
Performance Evaluation of Interpreted Bipolar Synchronization Schemes Using G. E. R. T..
European Workshop on Applications and Theory of Petri Nets 1987: 343-370 |
| 4 | | J. Carlier,
Philippe Chrétienne:
Timed Petri net schedules.
European Workshop on Applications and Theory of Petri Nets 1987: 62-84 |
| 1986 |
|---|
| 3 | | Philippe Chrétienne:
Timed petri nets: A solution to the minimum-time-reachability problem between two states of a timed-event graph.
Journal of Systems and Software 6(1-2): 95-101 (1986) |
| 1985 |
|---|
| 2 | | Philippe Chrétienne:
Timed Event Graphs: A Complete Study of Their Controlled Executions.
PNPM 1985: 47-54 |
| 1984 |
|---|
| 1 | | J. Carlier,
Philippe Chrétienne,
Claude Girault:
Modelling scheduling problems with timed Petri nets.
European Workshop on Applications and Theory in Petri Nets 1984: 62-82 |
