default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOdile Bellenguez-Morineau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Odile Bellenguez, Nadia Branuer, Alexis Tsoukiàs:
From decision aiding to the massive use of algorithms: where does the responsibility stand? CoRR abs/2406.13140 (2024)- 2022
- [j15]François Larroche, Odile Bellenguez
, Guillaume Massonnet:
Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups. Int. J. Prod. Res. 60(21): 6573-6596 (2022) - [i5]Odile Bellenguez, Nadia Brauner, Alexis Tsoukiàs:
Is there an Ethical Operational Research? CoRR abs/2207.01502 (2022) - 2021
- [j14]Tianyu Wang, Odile Bellenguez:
Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time. J. Sched. 24(6): 649-662 (2021) - [c6]François Larroche, Odile Bellenguez, Guillaume Massonnet:
Three-Phase Method for the Capacitated Lot-Sizing Problem with Sequence Dependent Setups. APMS (2) 2021: 694-702 - [c5]Odile Bellenguez, Olivier Cardin, Toinon Vigier, Colin de la Higuera:
Ethical Principles in Industry 4.0 Automated Decision-Making Systems. SOHOMA 2021: 333-347
2010 – 2019
- 2019
- [j13]Tianyu Wang, Odile Bellenguez-Morineau:
The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints. J. Sched. 22(3): 263-269 (2019) - [j12]Tianyu Wang, Odile Bellenguez-Morineau:
A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. J. Sched. 22(6): 709-714 (2019) - 2018
- [j11]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) - 2017
- [j10]Carlos Indriago, Olivier Cardin, Odile Bellenguez-Morineau, Naly Rakoto, Pierre Castagna, Edgar Chacón Ramírez:
Performance evaluation of holonic control of a switch arrival system. Concurr. Eng. Res. Appl. 25(1): 19-29 (2017) - [c4]Houda Harbaoui, Soulef Khalfallah, Odile Bellenguez-Morineau:
A Novel Hybrid GA for the Assignment of Jobs to Machines in a Complex Hybrid Flow Shop Problem. ISDA 2017: 640-649 - [c3]Houda Harbaoui, Soulef Khalfallah, Odile Bellenguez-Morineau:
A case study of a hybrid flow shop with no-wait and limited idle time to minimize material waste. SISY 2017: 207-212 - 2016
- [c2]Houda Harbaoui, Odile Bellenguez-Morineau, Soulef Khalfallah:
Scheduling a two-stage hybrid flow shop with dedicated machines, time lags and sequence-dependent family setup times. SMC 2016: 2990-2995 - 2015
- [b1]Odile Bellenguez-Morineau:
Contribution à l'ordonnancement et la planication de ressources humaines. University of Nantes, France, 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]Carlos Montoya, Odile Bellenguez-Morineau, Eric Pinson, David Rivreau:
Branch-and-price approach for the multi-skill project scheduling problem. Optim. Lett. 8(5): 1721-1734 (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, 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) - [j4]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
- [j3]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)
2000 – 2009
- 2008
- [j2]Odile Bellenguez-Morineau:
Methods to solve multi-skill project scheduling problem. 4OR 6(1): 85-88 (2008) - 2007
- [j1]Odile Bellenguez-Morineau, Emmanuel Néron:
A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem. RAIRO Oper. Res. 41(2): 155-170 (2007) - 2004
- [c1]Odile Bellenguez, Emmanuel Néron:
Lower Bounds for the Multi-skill Project Scheduling Problem with Hierarchical Levels of Skills. PATAT 2004: 229-243
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-10-07 22:10 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:
