Philippe Chrétienne

49 papers C 3Journal 38Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximation results on resource leveling problems.
Theor. Comput. Sci.
Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024 J jnl
Anchor-robust project scheduling with non-availability periods.
Discret. Optim.
Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024 J jnl
Anchored rescheduling problem with non-availability periods.
Oper. Res. Lett.
Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024 J jnl
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems.
CoRR
Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024 J jnl
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems.
J. Sched.
Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2023 C conf
An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints.
CoDIT
Philippe Chrétienne, Alain Quilliot, Hélène Toussaint
2023 J jnl
The Anchor-Robust Project Scheduling Problem.
Oper. Res.
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
2021 J jnl
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem.
CoRR
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
2021 J jnl
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem.
Eur. J. Oper. Res.
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
2021 J jnl
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times.
Ann. Oper. Res.
Philippe Chrétienne
2020 C conf
Anchored Rescheduling Problems Under Generalized Precedence Constraints.
ISCO
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
2020 J jnl
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures.
J. Sched.
Philippe Chrétienne
2018 J jnl
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines.
Discret. Appl. Math.
Philippe Chrétienne, Alain Quilliot
2017 J jnl
Anchored reactive and proactive solutions to the CPM-scheduling problem.
Eur. J. Oper. Res.
Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Alain Quilliot
2016 J jnl
On scheduling with the non-idling constraint.
Ann. Oper. Res.
Philippe Chrétienne
2015 J jnl
Network sharing by two mobile operators: beyond competition, cooperation.
RAIRO Oper. Res.
Alexandre Blogowski, Philippe Chrétienne, Fanny Pascual
2014 J jnl
A polynomial algorithm for the two-connections variant of the tree p-median problem.
Discret. Optim.
Philippe Chrétienne
2014 J jnl
On scheduling with the non-idling constraint.
4OR
Philippe Chrétienne
2014 J jnl
The location-dispatching problem: Polyhedral results and content delivery network design.
Discret. Appl. Math.
Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura
2013 — ch.
Homogeneous Non Idling Problems: Models and Algorithms.
Recent Advances in Computational Optimization
Alain Quilliot, Philippe Chrétienne, Benoit Bernay
2013 J jnl
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines.
Discret. Appl. Math.
Alain Quilliot, Philippe Chrétienne
2012 C conf
The Hogeneous Non Idling Scheduling Problem.
FedCSIS
Alain Quilliot, Philippe Chrétienne
2011 J jnl
Integrated batch sizing and scheduling on a single machine.
J. Sched.
Philippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum
2011 — conf
The integrated lot-sizing and vehicle routing problem.
CIPLS
Heitor Liberalino, Christophe Duhamel, Alain Quilliot, Safia Kedad-Sidhoum, Philippe Chrétienne
2010 J jnl
The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design.
Electron. Notes Discret. Math.
Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura
2009 J jnl
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups.
Discret. Appl. Math.
J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd
2008 J jnl
On single-machine scheduling without intermediate delays.
Discret. Appl. Math.
Philippe Chrétienne
2008 J jnl
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.
Eur. J. Oper. Res.
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey
2007 J jnl
Biclique completion problems for multicast network design.
Discret. Optim.
Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd
2006 J jnl
Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003).
Eur. J. Oper. Res.
Philippe Chrétienne
2006 J jnl
Preface.
Discret. Appl. Math.
Philippe Chrétienne
2003 J jnl
PERT scheduling with convex cost functions.
Theor. Comput. Sci.
Philippe Chrétienne, Francis Sourd
2002 J jnl
A cutting plane algorithm for the unrelated parallel machine scheduling problem.
Eur. J. Oper. Res.
Ethel Mokotoff, Philippe Chrétienne
2001 J jnl
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine.
RAIRO Oper. Res.
Philippe Chrétienne
2000 J jnl
On Graham's bound for cyclic scheduling.
Parallel Comput.
Philippe Chrétienne
2000 J jnl
Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication.
RAIRO Oper. Res.
Dalila Tayachi, Philippe Chrétienne, Khaled Mellouli
1999 J jnl
Fiber-to-object assignment heuristics.
Eur. J. Oper. Res.
Francis Sourd, Philippe Chrétienne
1999 J jnl
List Schedules for Cyclic Scheduling.
Discret. Appl. Math.
Philippe Chrétienne
1994 J jnl
Tree Scheduling with Communication Delays.
Discret. Appl. Math.
Philippe Chrétienne
1993 — conf
Grain Size and Communication Channels on Distributed Memory Multiprocessors.
PARCO
Jean-Yves Colin, Philippe Chrétienne
1991 J jnl
C.P.M. Scheduling with Small Communication Delays and Task Duplication.
Oper. Res.
Jean-Yves Colin, Philippe Chrétienne
1991 — conf
Mapping Graphs onto a Partially Reconfigurable Architecture.
EDMCC
Philippe Chrétienne, Françoise Lamour
1991 J jnl
The basic cyclic scheduling problem with deadlines.
Discret. Appl. Math.
Philippe Chrétienne
1989 J jnl
An Algorithm for Finding a Common Structure Shared by a Family of Strings.
IEEE Trans. Pattern Anal. Mach. Intell.
Anne M. Landraud, Jean-François Avril, Philippe Chrétienne
1987 — conf
Performance Evaluation of Interpreted Bipolar Synchronization Schemes Using G. E. R. T..
European Workshop on Applications and Theory of Petri Nets
D. Quichaud, Philippe Chrétienne
1987 — conf
Timed Petri net schedules.
European Workshop on Applications and Theory of Petri Nets
J. Carlier, Philippe Chrétienne
1986 J jnl
Timed petri nets: A solution to the minimum-time-reachability problem between two states of a timed-event graph.
J. Syst. Softw.
Philippe Chrétienne
1985 — conf
Timed Event Graphs: A Complete Study of Their Controlled Executions.
PNPM
Philippe Chrétienne
1984 — conf
Modelling scheduling problems with timed Petri nets.
European Workshop on Applications and Theory in Petri Nets
J. Carlier, Philippe Chrétienne, Claude Girault