Philippe Chrétienne

According to our database, Philippe Chrétienne authored at least 45 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems.

Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier

J. Sched., December, 2024

Anchored rescheduling problem with non-availability periods.

Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier

Oper. Res. Lett., 2024

Anchor-robust project scheduling with non-availability periods.

Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier

Discret. Optim., 2024

Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems.

Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier

CoRR, 2024

2023

The Anchor-Robust Project Scheduling Problem.

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau

Oper. Res., 2023

An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints.

Philippe Chrétienne, Alain Quilliot, Hélène Toussaint

Proceedings of the 9th International Conference on Control, 2023

2021

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem.

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau

Eur. J. Oper. Res., 2021

Reactive and proactive single-machine scheduling to maintain a maximum number of starting times.

Philippe Chrétienne

Ann. Oper. Res., 2021

2020

Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures.

Philippe Chrétienne

J. Sched., 2020

Anchored Rescheduling Problems Under Generalized Precedence Constraints.

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2018

A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines.

Philippe Chrétienne, Alain Quilliot

Discret. Appl. Math., 2018

2017

Anchored reactive and proactive solutions to the CPM-scheduling problem.

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Alain Quilliot

Eur. J. Oper. Res., 2017

2015

Network sharing by two mobile operators: beyond competition, cooperation.

Alexandre Blogowski, Philippe Chrétienne, Fanny Pascual

RAIRO Oper. Res., 2015

2014

A polynomial algorithm for the two-connections variant of the tree p-median problem.

Philippe Chrétienne

Discret. Optim., 2014

The location-dispatching problem: Polyhedral results and content delivery network design.

Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura

Discret. Appl. Math., 2014

On scheduling with the non-idling constraint.

Philippe Chrétienne

4OR, 2014

2013

Homogeneous Non Idling Problems: Models and Algorithms.

Alain Quilliot, Philippe Chrétienne, Benoit Bernay

Proceedings of the Recent Advances in Computational Optimization, 2013

Homogeneously non-idling schedules of unit-time jobs on identical parallel machines.

Alain Quilliot, Philippe Chrétienne

Discret. Appl. Math., 2013

2012

The Hogeneous Non Idling Scheduling Problem.

Alain Quilliot, Philippe Chrétienne

Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2011

Integrated batch sizing and scheduling on a single machine.

Philippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum

J. Sched., 2011

The integrated lot-sizing and vehicle routing problem.

Heitor Liberalino, Christophe Duhamel, Alain Quilliot, Safia Kedad-Sidhoum, Philippe Chrétienne

Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2009

On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups.

J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd

Discret. Appl. Math., 2009

2008

Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.

Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey

Eur. J. Oper. Res., 2008

On single-machine scheduling without intermediate delays.

Philippe Chrétienne

Discret. Appl. Math., 2008

2007

Biclique completion problems for multicast network design.

Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd

Discret. Optim., 2007

2006

Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003).

Philippe Chrétienne

Eur. J. Oper. Res., 2006

Preface.

Philippe Chrétienne

Discret. Appl. Math., 2006

2003

PERT scheduling with convex cost functions.

Philippe Chrétienne, Francis Sourd

Theor. Comput. Sci., 2003

2002

A cutting plane algorithm for the unrelated parallel machine scheduling problem.

Ethel Mokotoff, Philippe Chrétienne

Eur. J. Oper. Res., 2002

2001

Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine.

Philippe Chrétienne

RAIRO Oper. Res., 2001

2000

Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication.

Dalila Tayachi, Philippe Chrétienne, Khaled Mellouli

RAIRO Oper. Res., 2000

On Graham's bound for cyclic scheduling.

Philippe Chrétienne

Parallel Comput., 2000

1999

Fiber-to-object assignment heuristics.

Francis Sourd, Philippe Chrétienne

Eur. J. Oper. Res., 1999

List Schedules for Cyclic Scheduling.

Philippe Chrétienne

Discret. Appl. Math., 1999

1994

Tree Scheduling with Communication Delays.

Philippe Chrétienne

Discret. Appl. Math., 1994

1993

Grain Size and Communication Channels on Distributed Memory Multiprocessors.

Jean-Yves Colin, Philippe Chrétienne

Proceedings of the Parallel Computing: Trends and Applications, 1993

1991

C.P.M. Scheduling with Small Communication Delays and Task Duplication.

Jean-Yves Colin, Philippe Chrétienne

Oper. Res., 1991

The basic cyclic scheduling problem with deadlines.

Philippe Chrétienne

Discret. Appl. Math., 1991

Mapping Graphs onto a Partially Reconfigurable Architecture.

Philippe Chrétienne, Françoise Lamour

Proceedings of the Distributed Memory Computing, 2nd European Conference, 1991

1989

An Algorithm for Finding a Common Structure Shared by a Family of Strings.

Anne M. Landraud, Jean-François Avril, Philippe Chrétienne

IEEE Trans. Pattern Anal. Mach. Intell., 1989

1987

Performance Evaluation of Interpreted Bipolar Synchronization Schemes Using G. E. R. T..

D. Quichaud, Philippe Chrétienne

Proceedings of the Advances in Petri Nets 1988, 1987

Timed Petri net schedules.

J. Carlier, Philippe Chrétienne

Proceedings of the Advances in Petri Nets 1988, 1987

1986

Timed petri nets: A solution to the minimum-time-reachability problem between two states of a timed-event graph.

Philippe Chrétienne

J. Syst. Softw., 1986

1985

Timed Event Graphs: A Complete Study of Their Controlled Executions.

Philippe Chrétienne

Proceedings of the International Workshop on Timed Petri Nets, 1985

1984

Modelling scheduling problems with timed Petri nets.

J. Carlier, Philippe Chrétienne, Claude Girault

Proceedings of the Advances in Petri Nets 1984, 1984