Philippe Chrétienne

Orcid: 0000-0002-4507-5757

According to our database1, Philippe Chrétienne authored at least 40 papers between 1984 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints.
Proceedings of the 9th International Conference on Control, 2023

2021
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem.
Eur. J. Oper. Res., 2021

Reactive and proactive single-machine scheduling to maintain a maximum number of starting times.
Ann. Oper. Res., 2021

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

Anchored Rescheduling Problems Under Generalized Precedence Constraints.
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.
Discret. Appl. Math., 2018

2017
Anchored reactive and proactive solutions to the CPM-scheduling problem.
Eur. J. Oper. Res., 2017

2016
On scheduling with the non-idling constraint.
Ann. Oper. Res., 2016

2015
Network sharing by two mobile operators: beyond competition, cooperation.
RAIRO Oper. Res., 2015

2014
A polynomial algorithm for the two-connections variant of the tree p-median problem.
Discret. Optim., 2014

2013
Homogeneous Non Idling Problems: Models and Algorithms.
Proceedings of the Recent Advances in Computational Optimization, 2013

Homogeneously non-idling schedules of unit-time jobs on identical parallel machines.
Discret. Appl. Math., 2013

2012
The Hogeneous Non Idling Scheduling Problem.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2011
Integrated batch sizing and scheduling on a single machine.
J. Sched., 2011

The integrated lot-sizing and vehicle routing problem.
Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2010
The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design.
Electron. Notes Discret. Math., 2010

2009
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups.
Discret. Appl. Math., 2009

2008
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.
Eur. J. Oper. Res., 2008

On single-machine scheduling without intermediate delays.
Discret. Appl. Math., 2008

2007
Biclique completion problems for multicast network design.
Discret. Optim., 2007

2006
Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003).
Eur. J. Oper. Res., 2006

Preface.
Discret. Appl. Math., 2006

2003
PERT scheduling with convex cost functions.
Theor. Comput. Sci., 2003

2002
A cutting plane algorithm for the unrelated parallel machine scheduling problem.
Eur. J. Oper. Res., 2002

2001
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine.
RAIRO Oper. Res., 2001

2000
Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication.
RAIRO Oper. Res., 2000

On Graham's bound for cyclic scheduling.
Parallel Comput., 2000

1999
Fiber-to-object assignment heuristics.
Eur. J. Oper. Res., 1999

List Schedules for Cyclic Scheduling.
Discret. Appl. Math., 1999

1994
Tree Scheduling with Communication Delays.
Discret. Appl. Math., 1994

1993
Grain Size and Communication Channels on Distributed Memory Multiprocessors.
Proceedings of the Parallel Computing: Trends and Applications, 1993

1991
C.P.M. Scheduling with Small Communication Delays and Task Duplication.
Oper. Res., 1991

The basic cyclic scheduling problem with deadlines.
Discret. Appl. Math., 1991

Mapping Graphs onto a Partially Reconfigurable Architecture.
Proceedings of the Distributed Memory Computing, 2nd European Conference, 1991

1989
An Algorithm for Finding a Common Structure Shared by a Family of Strings.
IEEE Trans. Pattern Anal. Mach. Intell., 1989

1987
Performance Evaluation of Interpreted Bipolar Synchronization Schemes Using G. E. R. T..
Proceedings of the Advances in Petri Nets 1988, 1987

Timed Petri net schedules.
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.
J. Syst. Softw., 1986

1985
Timed Event Graphs: A Complete Study of Their Controlled Executions.
Proceedings of the International Workshop on Timed Petri Nets, 1985

1984
Modelling scheduling problems with timed Petri nets.
Proceedings of the Advances in Petri Nets 1984, 1984


  Loading...