default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathalie Sauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Ayoub Tighazoui, Christophe Sauvey, Nathalie Sauer, B. Rose:
Rescheduling of a Single Machine Problem Thanks to Time Dependent Variable Weights. CoDIT 2023: 71-76- 2021
- [j16]Ayoub Tighazoui
, Christophe Sauvey, Nathalie Sauer:
Predictive-reactive strategy for identical parallel machine rescheduling. Comput. Oper. Res. 134: 105372 (2021) - [c14]Ayoub Tighazoui, Christophe Sauvey, Nathalie Sauer:
Heuristics based on MILP for solving a flow shop rescheduling problem simultaneously considering efficiency and stability. CASE 2021: 2079-2084 - 2020
- [j15]Christophe Sauvey, Nathalie Sauer:
Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion. Algorithms 13(5): 112 (2020) - [c13]Ayoub Tighazoui, Christophe Sauvey, Nathalie Sauer:
New efficiency-stability criterion in a rescheduling problem with dynamic jobs weights. CoDIT 2020: 475-480 - [c12]Farah Gabsi, Frédéric Hamelin, Nathalie Sauer, Joseph-Julien Yamé:
le-Regularized Economic Model Predictive Control for Thermal Comfort in Multizone Buildings. SMARTGREENS 2020: 137-148
2010 – 2019
- 2019
- [c11]Joseph-Julien Yamé, Farah Gabsi, Tejaswinee Darure, Tushar Jain, Frédéric Hamelin, Nathalie Sauer:
Optimality Condition Decomposition Approach to Distributed Model Predictive Control. ACC 2019: 742-747 - [c10]Farah Gabsi, Frédéric Hamelin, Nathalie Sauer, Dominique Sauter:
Fault-Tolerant Economic Model Predictive Control for Building Temperature Regulation using $\ell_{\varepsilon}$ -Regularization. SysTol 2019: 232-237 - 2017
- [j14]Ayse Akbalik, Atidel B. Hadj-Alouane, Nathalie Sauer, Houcem Ghribi:
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract. Eur. J. Oper. Res. 257(2): 483-493 (2017) - 2016
- [c9]Afef Bouguerra, Christophe Sauvey, Nathalie Sauer:
Online assignment strategies for emergent, urgent and work-in-cases surgeries in an operating theatre. CoDIT 2016: 438-443 - 2015
- [c8]Christophe Sauvey, Nathalie Sauer, Wajdi Trabelsi:
Job-Shop Scheduling with Mixed Blocking Constraints between Operations. MCO (2) 2015: 331-342 - 2013
- [c7]Christian Serrano, Wassila Aggoune-Mtalaa, Nathalie Sauer:
Dynamic Models for Green Logistic Networks Design. MIM 2013: 736-741 - 2012
- [j13]Wajdi Trabelsi, Christophe Sauvey, Nathalie Sauer:
Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems. Comput. Oper. Res. 39(11): 2520-2527 (2012) - [j12]Sadok Turki, Sophie Hennequin, Nathalie Sauer:
Perturbation analysis-based optimisation for a failure-prone manufacturing system with constant delivery time and stochastic demand. Int. J. Adv. Oper. Manag. 4(1/2): 124-153 (2012) - [j11]Christophe Sauvey, Nathalie Sauer:
A genetic algorithm with genes-association recognition for flowshop scheduling problems. J. Intell. Manuf. 23(4): 1167-1177 (2012) - 2010
- [c6]Ali Gorine, Nathalie Sauer:
Lower bounds and simulated annealing for job shop scheduling problems with blocking constrains. ETFA 2010: 1-8
2000 – 2009
- 2009
- [j10]Simon Tamayo, Thibaud Monteiro, Nathalie Sauer:
Deliveries optimization by exploiting production traceability information. Eng. Appl. Artif. Intell. 22(4-5): 557-568 (2009) - [j9]Stéphane Dauzère-Pérès, Nathalie Sauer:
Feature cluster: Planning and scheduling in industrial and logistic systems. Eur. J. Oper. Res. 199(3): 694 (2009) - [j8]Simon Tamayo, Thibaud Monteiro, Nathalie Sauer:
Dispersion optimisation using a genetic algorithm. Int. J. Adv. Oper. Manag. 1(2/3): 267-285 (2009) - [c5]Kun Yuan, Nathalie Sauer, Christophe Sauvey:
Application of EM Algorithm to Hybrid Flow Shop Scheduling Problems with a Special Blocking. ETFA 2009: 1-7 - 2006
- [j7]S. Martinez, Stéphane Dauzère-Pérès, Christelle Guéret, Yazid Mati, Nathalie Sauer:
Complexity of flowshop scheduling problems with a new blocking constraint. Eur. J. Oper. Res. 169(3): 855-864 (2006) - 2004
- [c4]Leila Toursi, Nathalie Sauer:
Branch and bound approach for marking optimization problem of weighted marked graphs. SMC (2) 2004: 1777-1782 - [c3]Mustapha Mostefaoui, Isabel Demongodin, Nathalie Sauer:
Transitory state of neutral continuous marked graphs. SMC (2) 2004: 1813-1818 - 2003
- [j6]Nathalie Sauer:
Marking Optimization of Weighted Marked Graphs. Discret. Event Dyn. Syst. 13(3): 245-262 (2003) - 2000
- [c2]Isabel Demongodin, Mustapha Mostefaoui, Nathalie Sauer:
Steady state of continuous neutral weighted marked graphs. SMC 2000: 3189-3194
1990 – 1999
- 1998
- [j5]Jean-Marie Proth, Nathalie Sauer:
Scheduling of piecewise constant product flows: A Petri net approach. Eur. J. Oper. Res. 106(1): 45-56 (1998) - 1997
- [j4]Fabrice Chauvet, Névine Hafez, Jean-Marie Proth, Nathalie Sauer:
Management of a pool of self-service cars. J. Intell. Manuf. 8(5): 459-465 (1997) - [j3]Jean-Marie Proth, Nathalie Sauer, Xiaolan Xie:
Optimization of the number of transportation devices in a flexible manufacturing system using event graphs. IEEE Trans. Ind. Electron. 44(3): 298-306 (1997) - 1996
- [j2]Nathalie Sauer, Xiaolan Xie:
Asymptotic properties of stochastic timed event graphs. Discret. Event Dyn. Syst. 6(2): 181-203 (1996) - [j1]Jean-Marie Proth, Nathalie Sauer, Yorai Wardi, Xiaolan Xie:
Marking optimization of stochastic timed event graphs using IPA. Discret. Event Dyn. Syst. 6(3): 221-239 (1996) - 1993
- [c1]Nathalie Sauer, Xiaolan Xie:
Marking Optimization of Stochastic Timed Event Graphs. Application and Theory of Petri Nets 1993: 357-376
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 2025-01-09 13:17 CET 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:
