Philippe Chrétienne - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2025

Approximation results on resource leveling problemsPascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier. TCS, 1053:115430, 2025. [doi]

2024

2023

The Anchor-Robust Project Scheduling ProblemPascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. ior, 71(6):2267-2290, 2023. [doi]

An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling ConstraintsPhilippe Chrétienne, Alain Quilliot, Hélène Toussaint. codit 2023: 136-141 [doi]

2021

Dominance-based linear formulation for the Anchor-Robust Project Scheduling ProblemPascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. eor, 295(1):22-33, 2021. [doi]

Reactive and proactive single-machine scheduling to maintain a maximum number of starting timesPhilippe Chrétienne. anor, 298(1):111-124, 2021. [doi]

2020

Anchored Rescheduling Problems Under Generalized Precedence ConstraintsPascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. iscopt 2020: 156-166 [doi]

Maximizing the number of jobs scheduled at their baseline starting times in case of machine failuresPhilippe Chrétienne. scheduling, 23(1):135-143, 2020. [doi]

2018

A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machinesPhilippe Chrétienne, Alain Quilliot. DAM, 243:132-139, 2018. [doi]

2017

Anchored reactive and proactive solutions to the CPM-scheduling problemPascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Alain Quilliot. eor, 261(1):67-74, 2017. [doi]

2016

On scheduling with the non-idling constraintPhilippe Chrétienne. anor, 240(1):301-319, 2016. [doi]

2015

Network sharing by two mobile operators: beyond competition, cooperationAlexandre Blogowski, Philippe Chrétienne, Fanny Pascual. rairo, 49(3):635-650, 2015. [doi]

2014

On scheduling with the non-idling constraintPhilippe Chrétienne. 4or, 12(2):101-121, 2014. [doi]

The location-dispatching problem: Polyhedral results and content delivery network designPhilippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura. DAM, 164:68-85, 2014. [doi]

A polynomial algorithm for the two-connections variant of the tree p-median problemPhilippe Chrétienne. disopt, 14:1-16, 2014. [doi]

2013

Homogeneously non-idling schedules of unit-time jobs on identical parallel machinesAlain Quilliot, Philippe Chrétienne. DAM, 161(10-11):1586-1597, 2013. [doi]

Homogeneous Non Idling Problems: Models and AlgorithmsAlain Quilliot, Philippe Chrétienne, Benoit Bernay. In Stefka Fidanova, editor, Recent Advances in Computational Optimization. Volume 470 of Studies in Computational Intelligence, pages 115-134, Springer, 2013. [doi]

2012

The Hogeneous Non Idling Scheduling ProblemAlain Quilliot, Philippe Chrétienne. FedCSIS 2012: 447-454 [doi]

2011

Integrated batch sizing and scheduling on a single machinePhilippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum. scheduling, 14(6):541-555, 2011. [doi]

The integrated lot-sizing and vehicle routing problemHeito Liberalino, Christophe Duhamel, Alain Quilliot, Safia Kedad-Sidhoum, Philippe Chrétienne. cipls 2011: 47-52 [doi]

2010

The Location-Dispatching Problem: polyhedral results and Content Delivery Network DesignPhilippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura. endm, 36:867-874, 2010. [doi]

2008

On single-machine scheduling without intermediate delaysPhilippe Chrétienne. DAM, 156(13):2543-2550, 2008. [doi]

Simple bounds and greedy algorithms for decomposing a flow into a minimal set of pathsB. Vatinlen, F. Chauvet, Philippe Chrétienne, P. Mahey. eor, 185(3):1390-1401, 2008. [doi]

2007

Biclique completion problems for multicast network designNathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd. disopt, 4(3-4):360-377, 2007. [doi]

2006

Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003)Philippe Chrétienne. eor, 168(2):658-661, 2006. [doi]

PrefacePhilippe Chrétienne. DAM, 154(15):2041-2042, 2006. [doi]

2003

PERT scheduling with convex cost functionsPhilippe Chrétienne, Francis Sourd. TCS, 292(1):145-164, 2003.

2002

A cutting plane algorithm for the unrelated parallel machine scheduling problemEthel Mokotoff, Philippe Chrétienne. eor, 141(3):515-525, 2002. [doi]

2001

Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single MachinePhilippe Chrétienne. rairo, 35(2):165-187, 2001. [doi]

2000

Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communicationDalila Tayachi, Philippe Chrétienne, Khaled Mellouli. rairo, 34(4):467-485, 2000. [doi]

1999

List Schedules for Cyclic SchedulingPhilippe Chrétienne. DAM, 94(1-3):141-159, 1999. [doi]

Fiber-to-object assignment heuristicsFrancis Sourd, Philippe Chrétienne. eor, 117(1):1-14, 1999. [doi]

1994

Tree Scheduling with Communication DelaysPhilippe Chrétienne. DAM, 49(1-3):129-141, 1994.

1993

Grain Size and Communication Channels on Distributed Memory MultiprocessorsJean-Yves Colin, Philippe Chrétienne. parco 1994: 281-286

1991

Mapping Graphs onto a Partially Reconfigurable ArchitecturePhilippe Chrétienne, Françoise Lamour. edmcc 1991: 73-79

The basic cyclic scheduling problem with deadlinesPhilippe Chrétienne. DAM, 30(2-3):109-123, 1991. [doi]

C.P.M. Scheduling with Small Communication Delays and Task DuplicationJean-Yves Colin, Philippe Chrétienne. ior, 39(4):680-684, 1991. [doi]

1989

An Algorithm for Finding a Common Structure Shared by a Family of StringsAnne M. Landraud, Jean-François Avril, Philippe Chrétienne. pami, 11(8):890-895, 1989. [doi]

1987

Timed Petri net schedulesJ. Carlier, Philippe Chrétienne. apn 1988: 62-84

Performance Evaluation of Interpreted Bipolar Synchronization Schemes Using G. E. R. T.D. Quichaud, Philippe Chrétienne. apn 1988: 343-370

1985

Timed Event Graphs: A Complete Study of Their Controlled ExecutionsPhilippe Chrétienne. pnpm 1985: 47-54

1984

Modelling scheduling problems with timed Petri netsJ. Carlier, Philippe Chrétienne, Claude Girault. apn 1985: 62-82

Sign in or sign up to see more results.

runs on WebDSL