default search action
Marie-Claude Portmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c5]Fatima Ghedjati, Marie-Claude Portmann:
Dynamic heuristics for the generalized job-shop scheduling problem. SMC 2009: 2562-2567 - 2008
- [j12]Ammar Oulamara, Marie-Claude Portmann:
Project management and scheduling. Eur. J. Oper. Res. 189(3): 1133-1135 (2008) - [c4]Wladyslaw A. Janiak, Adam Janiak, Marie-Claude Portmann:
Single machine scheduling with job ready and delivery times subject to resource constraints. IPDPS 2008: 1-7 - 2007
- [j11]Mohamed Ali Aloulou, Mikhail Y. Kovalyov
, Marie-Claude Portmann:
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity. RAIRO Oper. Res. 41(1): 1-18 (2007) - 2006
- [j10]Julien Fondrevelle, Ammar Oulamara, Marie-Claude Portmann:
Permutation flowshop scheduling problems with maximal and minimal time lags. Comput. Oper. Res. 33: 1540-1556 (2006) - [j9]Yuri N. Sotskov, Alexandre Dolgui
Stability analysis of an optimal balance for an assembly line with fixed cycle time. Eur. J. Oper. Res. 168(3): 783-797 (2006) - [j8]Latifa Ouzizi, Didier Anciaux, Marie-Claude Portmann, François B. Vernadat:
A model for cooperative planning within a virtual enterprise. Int. J. Comput. Integr. Manuf. 19(3): 197-209 (2006) - [j7]Mikhail Y. Kovalyov
Optimal testing and repairing a failed series system. J. Comb. Optim. 12(3): 279-295 (2006) - 2005
- [j6]Adam Janiak, Mikhail Y. Kovalyov
Single machine group scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 162(1): 112-121 (2005) - [i1]Julien Fondrevelle, Ammar Oulamara, Marie-Claude Portmann:
Minimizing makespan in flowshop with time lags. CoRR abs/cs/0507016 (2005) - 2004
- [j5]Mohamed Ali Aloulou, Mikhail Y. Kovalyov
Maximization Problems in Single Machine Scheduling. Ann. Oper. Res. 129(1-4): 21-32 (2004) - 2001
- [c3]Riad Aggoune, Abdel Halim Mahdi, Marie-Claude Portmann:
Genetic algorithms for the flow shop scheduling problem with availability constraints. SMC 2001: 2546-2551 - 2000
- [c2]Marie-Claude Portmann, Antony Vignier:
Performances's study on crossover operators keeping good schemata for some scheduling problems. GECCO 2000: 331-338
1990 – 1999
- 1998
- [j4]Adam Janiak, Marie-Claude Portmann:
Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations. Ann. Oper. Res. 83: 95-114 (1998) - [j3]Marie-Claude Portmann, Antony Vignier, D. Dardilhac, D. Dezalay:
Branch and bound crossed with GA to solve hybrid flowshops. Eur. J. Oper. Res. 107(2): 389-400 (1998) - 1995
- [j2]Marie-Claude Portmann, Dominique Rohr:
Hierarchical production management applied to an iron and steel industry. J. Intell. Manuf. 6(2): 79-85 (1995) - 1993
- [j1]Chengbin Chu
Application of the artificial memory approach to multicriteria scheduling problems. J. Intell. Manuf. 4(2): 151-161 (1993) - [c1]Brigitte Finel, Marie-Claude Portmann:
A stochastic scheduling problem issued from iron and steel industry : Some results. System Modelling and Optimization 1993: 795-804
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-25 05:48 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: