Philippe Chrétienne

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 12

Top Topics

Scheduling Problem

Top Venues

Ann. Oper. Res.

Discret. Appl. Math.

Eur. J. Oper. Res.

Publications

Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. CoRR (2024)
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
The Anchor-Robust Project Scheduling Problem. Oper. Res. 71 (6) (2023)
Philippe Chrétienne, Alain Quilliot, Hélène Toussaint
An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints. CoDIT (2023)
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. CoRR (2021)
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. Eur. J. Oper. Res. 295 (1) (2021)
Philippe Chrétienne
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times. Ann. Oper. Res. 298 (1) (2021)
Philippe Chrétienne
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures. J. Sched. 23 (1) (2020)
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO (2020)
Philippe Chrétienne, Alain Quilliot
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines. Discret. Appl. Math. 243 (2018)
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Alain Quilliot
Anchored reactive and proactive solutions to the CPM-scheduling problem. Eur. J. Oper. Res. 261 (1) (2017)
Philippe Chrétienne
On scheduling with the non-idling constraint. Ann. Oper. Res. 240 (1) (2016)
Alexandre Blogowski, Philippe Chrétienne, Fanny Pascual
Network sharing by two mobile operators: beyond competition, cooperation. RAIRO Oper. Res. 49 (3) (2015)
Philippe Chrétienne
On scheduling with the non-idling constraint. 4OR 12 (2) (2014)
Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura
The location-dispatching problem: Polyhedral results and content delivery network design. Discret. Appl. Math. 164 (2014)
Philippe Chrétienne
A polynomial algorithm for the two-connections variant of the tree p-median problem. Discret. Optim. 14 (2014)
Alain Quilliot, Philippe Chrétienne
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines. Discret. Appl. Math. 161 (10-11) (2013)
Alain Quilliot, Philippe Chrétienne
The Hogeneous Non Idling Scheduling Problem. FedCSIS (2012)
Heitor Liberalino, Christophe Duhamel, Alain Quilliot, Safia Kedad-Sidhoum, Philippe Chrétienne
The integrated lot-sizing and vehicle routing problem. CIPLS (2011)
Philippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum
Integrated batch sizing and scheduling on a single machine. J. Sched. 14 (6) (2011)
Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura
The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. Electron. Notes Discret. Math. 36 (2010)
J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. Discret. Appl. Math. 157 (17) (2009)
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. Eur. J. Oper. Res. 185 (3) (2008)
Philippe Chrétienne
On single-machine scheduling without intermediate delays. Discret. Appl. Math. 156 (13) (2008)
Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd
Biclique completion problems for multicast network design. Discret. Optim. 4 (3-4) (2007)
Philippe Chrétienne
Preface. Discret. Appl. Math. 154 (15) (2006)
Philippe Chrétienne
Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003). Eur. J. Oper. Res. 168 (2) (2006)
Philippe Chrétienne, Francis Sourd
PERT scheduling with convex cost functions. Theor. Comput. Sci. 292 (1) (2003)
Ethel Mokotoff, Philippe Chrétienne
A cutting plane algorithm for the unrelated parallel machine scheduling problem. Eur. J. Oper. Res. 141 (3) (2002)
Philippe Chrétienne
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine. RAIRO Oper. Res. 35 (2) (2001)
Dalila Tayachi, Philippe Chrétienne, Khaled Mellouli
Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication. RAIRO Oper. Res. 34 (4) (2000)
Philippe Chrétienne
On Graham's bound for cyclic scheduling. Parallel Comput. 26 (9) (2000)
Philippe Chrétienne
List Schedules for Cyclic Scheduling. Discret. Appl. Math. 94 (1-3) (1999)
Francis Sourd, Philippe Chrétienne
Fiber-to-object assignment heuristics. Eur. J. Oper. Res. 117 (1) (1999)
Philippe Chrétienne
Tree Scheduling with Communication Delays. Discret. Appl. Math. 49 (1-3) (1994)
Jean-Yves Colin, Philippe Chrétienne
Grain Size and Communication Channels on Distributed Memory Multiprocessors. PARCO (1993)
Philippe Chrétienne, Françoise Lamour
Mapping Graphs onto a Partially Reconfigurable Architecture. EDMCC (1991)
Philippe Chrétienne
The basic cyclic scheduling problem with deadlines. Discret. Appl. Math. 30 (2-3) (1991)
Jean-Yves Colin, Philippe Chrétienne
C.P.M. Scheduling with Small Communication Delays and Task Duplication. Oper. Res. 39 (4) (1991)
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) (1989)
J. Carlier, Philippe Chrétienne
Timed Petri net schedules. European Workshop on Applications and Theory of Petri Nets (1987)
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)
Philippe Chrétienne
Timed petri nets: A solution to the minimum-time-reachability problem between two states of a timed-event graph. J. Syst. Softw. 6 (1-2) (1986)
Philippe Chrétienne
Timed Event Graphs: A Complete Study of Their Controlled Executions. PNPM (1985)
J. Carlier, Philippe Chrétienne, Claude Girault
Modelling scheduling problems with timed Petri nets. European Workshop on Applications and Theory in Petri Nets (1984)