default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamien Prot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j10]Damien Prot, Odile Bellenguez-Morineau
:
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. J. Sched. 21(1): 3-16 (2018)- 2015
- [j9]Agnès Le Roux, Odile Bellenguez-Morineau, Christelle Guéret, Damien Prot:
Complexity of a one-to-one meeting scheduling problem with two types of actors. J. Oper. Res. Soc. 66(10): 1730-1741 (2015) - [j8]Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot:
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines. J. Sched. 18(3): 299-304 (2015) - [i4]Damien Prot, Odile Bellenguez-Morineau:
Impact of precedence constraints on complexity of scheduling problems: a survey. CoRR abs/1510.04833 (2015) - 2014
- [j7]Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci:
A 4D-sequencing approach for air traffic management. Eur. J. Oper. Res. 237(2): 411-425 (2014) - [i3]Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot:
A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines. CoRR abs/1404.5424 (2014) - 2013
- [j6]Tanguy Lapègue, Odile Bellenguez-Morineau, Damien Prot:
A constraint-based approach for the shift design personnel task scheduling problem with equity. Comput. Oper. Res. 40(10): 2450-2465 (2013) - [j5]Damien Prot, Christophe Rapine:
Approximations for the Two-Machine Cross-Docking Flow Shop Problem. Discret. Appl. Math. 161(13-14): 2107-2119 (2013) - [j4]Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou:
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria. Eur. J. Oper. Res. 231(2): 282-287 (2013) - [j3]Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou:
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012). J. Sched. 16(4): 437-438 (2013) - 2012
- [j2]Damien Prot, Odile Bellenguez-Morineau:
Tabu search and lower bound for an industrial complex shop scheduling problem. Comput. Ind. Eng. 62(4): 1109-1118 (2012) - 2011
- [i2]Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou:
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]. CoRR abs/1112.4396 (2011) - [i1]Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou:
Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates. CoRR abs/1112.4400 (2011) - 2010
- [j1]Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci:
Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate. Eur. J. Oper. Res. 207(1): 184-196 (2010)
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-04-24 22:46 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:
