default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Chrétienne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. CoRR abs/2406.08104 (2024)- 2023
- [j32]Pascale Bendotti
, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
The Anchor-Robust Project Scheduling Problem. Oper. Res. 71(6): 2267-2290 (2023) - [c10]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: 136-141 - 2021
- [j31]Philippe Chrétienne:
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times. Ann. Oper. Res. 298(1): 111-124 (2021) - [j30]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): 22-33 (2021) - [i1]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. CoRR abs/2106.12055 (2021) - 2020
- [j29]Philippe Chrétienne:
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures. J. Sched. 23(1): 135-143 (2020) - [c9]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO 2020: 156-166
2010 – 2019
- 2018
- [j28]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: 132-139 (2018) - 2017
- [j27]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): 67-74 (2017) - 2016
- [j26]Philippe Chrétienne:
On scheduling with the non-idling constraint. Ann. Oper. Res. 240(1): 301-319 (2016) - 2015
- [j25]Alexandre Blogowski, Philippe Chrétienne, Fanny Pascual:
Network sharing by two mobile operators: beyond competition, cooperation. RAIRO Oper. Res. 49(3): 635-650 (2015) - 2014
- [j24]Philippe Chrétienne:
On scheduling with the non-idling constraint. 4OR 12(2): 101-121 (2014) - [j23]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: 68-85 (2014) - [j22]Philippe Chrétienne:
A polynomial algorithm for the two-connections variant of the tree p-median problem. Discret. Optim. 14: 1-16 (2014) - 2013
- [j21]Alain Quilliot, Philippe Chrétienne:
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines. Discret. Appl. Math. 161(10-11): 1586-1597 (2013) - [p1]Alain Quilliot, Philippe Chrétienne, Benoit Bernay:
Homogeneous Non Idling Problems: Models and Algorithms. Recent Advances in Computational Optimization 2013: 115-134 - 2012
- [c8]Alain Quilliot, Philippe Chrétienne:
The Hogeneous Non Idling Scheduling Problem. FedCSIS 2012: 447-454 - 2011
- [j20]Philippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum:
Integrated batch sizing and scheduling on a single machine. J. Sched. 14(6): 541-555 (2011) - [c7]Heitor Liberalino, Christophe Duhamel, Alain Quilliot, Safia Kedad-Sidhoum, Philippe Chrétienne:
The integrated lot-sizing and vehicle routing problem. CIPLS 2011: 47-52 - 2010
- [j19]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: 867-874 (2010)
2000 – 2009
- 2009
- [j18]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): 3656-3664 (2009) - 2008
- [j17]Philippe Chrétienne:
On single-machine scheduling without intermediate delays. Discret. Appl. Math. 156(13): 2543-2550 (2008) - [j16]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): 1390-1401 (2008) - 2007
- [j15]Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd:
Biclique completion problems for multicast network design. Discret. Optim. 4(3-4): 360-377 (2007) - 2006
- [j14]Philippe Chrétienne:
Preface. Discret. Appl. Math. 154(15): 2041-2042 (2006) - [j13]Philippe Chrétienne:
Peter Brucker, Scheduling Algorithms (fourth ed.), Osnabrück University, Springer (2003). Eur. J. Oper. Res. 168(2): 658-661 (2006) - 2003
- [j12]Philippe Chrétienne, Francis Sourd:
PERT scheduling with convex cost functions. Theor. Comput. Sci. 292(1): 145-164 (2003) - 2002
- [j11]Ethel Mokotoff, Philippe Chrétienne:
A cutting plane algorithm for the unrelated parallel machine scheduling problem. Eur. J. Oper. Res. 141(3): 515-525 (2002) - 2001
- [j10]Philippe Chrétienne:
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine. RAIRO Oper. Res. 35(2): 165-187 (2001) - 2000
- [j9]Philippe Chrétienne:
On Graham's bound for cyclic scheduling. Parallel Comput. 26(9): 1163-1174 (2000) - [j8]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): 467-485 (2000)
1990 – 1999
- 1999
- [j7]Philippe Chrétienne:
List Schedules for Cyclic Scheduling. Discret. Appl. Math. 94(1-3): 141-159 (1999) - [j6]Francis Sourd, Philippe Chrétienne:
Fiber-to-object assignment heuristics. Eur. J. Oper. Res. 117(1): 1-14 (1999) - 1994
- [j5]Philippe Chrétienne:
Tree Scheduling with Communication Delays. Discret. Appl. Math. 49(1-3): 129-141 (1994) - 1993
- [c6]Jean-Yves Colin, Philippe Chrétienne:
Grain Size and Communication Channels on Distributed Memory Multiprocessors. PARCO 1993: 281-286 - 1991
- [j4]Philippe Chrétienne:
The basic cyclic scheduling problem with deadlines. Discret. Appl. Math. 30(2-3): 109-123 (1991) - [j3]Jean-Yves Colin, Philippe Chrétienne:
C.P.M. Scheduling with Small Communication Delays and Task Duplication. Oper. Res. 39(4): 680-684 (1991) - [c5]Philippe Chrétienne, Françoise Lamour:
Mapping Graphs onto a Partially Reconfigurable Architecture. EDMCC 1991: 73-79
1980 – 1989
- 1989
- [j2]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): 890-895 (1989) - 1987
- [c4]J. Carlier, Philippe Chrétienne:
Timed Petri net schedules. European Workshop on Applications and Theory of Petri Nets 1987: 62-84 - [c3]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: 343-370 - 1986
- [j1]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): 95-101 (1986) - 1985
- [c2]Philippe Chrétienne:
Timed Event Graphs: A Complete Study of Their Controlled Executions. PNPM 1985: 47-54 - 1984
- [c1]J. Carlier, Philippe Chrétienne, Claude Girault:
Modelling scheduling problems with timed Petri nets. European Workshop on Applications and Theory in Petri Nets 1984: 62-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
