default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDalila B. M. M. Fontes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j22]Seyed Mahdi Homayouni
, Dalila B. M. M. Fontes:
Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: A mathematical model and heuristic solutions. Int. Trans. Oper. Res. 32(1): 194-220 (2025)- 2024
- [j21]Dalila B. M. M. Fontes, Seyed Mahdi Homayouni, João Chaves Fernandes:
Energy-efficient job shop scheduling problem with transport resources considering speed adjustable resources. Int. J. Prod. Res. 62(3): 867-890 (2024) - 2023
- [j20]Dalila B. M. M. Fontes, Seyed Mahdi Homayouni, José Fernando Gonçalves:
A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Eur. J. Oper. Res. 306(3): 1140-1157 (2023) - [j19]Seyed Mahdi Homayouni, Dalila B. M. M. Fontes, José Fernando Gonçalves:
A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. Int. Trans. Oper. Res. 30(2): 688-716 (2023) - [c16]Seyed Mahdi Homayouni, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A Hybrid BRKGA for Joint Scheduling Production, Transport, and Storage/Retrieval in Flexible Job Shops. GECCO Companion 2023: 211-214 - [c15]Diana G. Campinho, Dalila B. M. M. Fontes, Alexandre F. P. Ferreira, Fernando A. C. C. Fontes:
Job Deterioration Effects in Job-shop Scheduling Problems. IEEM 2023: 1558-1562 - 2022
- [j18]Dalila B. M. M. Fontes, Seyed Mahdi Homayouni, Mauricio G. C. Resende:
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems. J. Comb. Optim. 44(2): 1284-1322 (2022) - [c14]Seyed Mahdi Homayouni, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A Multi-Population BRKGA for Energy-Efficient Job Shop Scheduling with Speed Adjustable Machines. MIC 2022: 513-518 - 2021
- [j17]Seyed Mahdi Homayouni, Dalila B. M. M. Fontes:
Production and transport scheduling in flexible job shop manufacturing systems. J. Glob. Optim. 79(2): 463-502 (2021) - [c13]Seyed Mahdi Homayouni, Dalila B. M. M. Fontes:
A MILP Model for Energy-Efficient Job Shop Scheduling Problem and Transport Resources. APMS (1) 2021: 378-386 - 2020
- [j16]Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko:
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem. INFORMS J. Comput. 32(3): 747-762 (2020)
2010 – 2019
- 2019
- [j15]Dalila B. M. M. Fontes, Seyed Mahdi Homayouni:
Joint production and transportation scheduling in flexible manufacturing systems. J. Glob. Optim. 74(4): 879-908 (2019) - [c12]Seyed Mahdi Homayouni, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A BRKGA for the integrated scheduling problem in FMSs. GECCO (Companion) 2019: 287-288 - 2018
- [j14]Márcia Oliveira, Dalila B. M. M. Fontes, Maria Teresa Pereira:
Evaluating vehicle painting plans in an automobile assembly plant using an integrated AHP-PROMETHEE approach. Int. Trans. Oper. Res. 25(4): 1383-1406 (2018) - [j13]Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko:
A nonconvex quadratic optimization approach to the maximum edge weight clique problem. J. Glob. Optim. 72(2): 219-240 (2018) - 2017
- [c11]Luís A. C. Roque, Fernando A. C. C. Fontes, Dalila B. M. M. Fontes:
New Formulations for the Unit Commitment Problem - Optimal Control and Switching-Time Parameterization Approaches. ICINCO (1) 2017: 326-331 - 2015
- [j12]Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach. Optim. Lett. 9(3): 451-464 (2015) - 2014
- [j11]Luís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A hybrid biased random key genetic algorithm approach for the unit commitment problem. J. Comb. Optim. 28(1): 140-166 (2014) - [c10]Norberto Bessa, Dalila B. M. M. Fontes:
Poster city logistics: analyzing the impact of different public policies in the oporto city. IDEAS 2014: 372-373 - [p1]Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
Hop-Constrained Tree-Shaped Networks. Examining Robustness and Vulnerability of Networked Systems 2014: 192-208 - 2013
- [j10]Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
Concave minimum cost network flow problems solved with a colony of ants. J. Heuristics 19(1): 1-33 (2013) - [j9]Dalila B. M. M. Fontes, José Fernando Gonçalves:
A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. Optim. Lett. 7(6): 1303-1324 (2013) - 2012
- [c9]Fernando A. C. C. Fontes, Dalila B. M. M. Fontes, Luís A. C. Roque:
An optimal control approach to the Unit Commitment problem. CDC 2012: 7069-7074 - [c8]Luís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
BRKGA Adapted to Multiobjective Unit Commitment - Solving Pareto Frontier for UC Multiobjective Problem using BRKGA SPEA2 NPGA and NSGA II Techniques. ICORES 2012: 64-72 - 2011
- [j8]Susana Silva, José Nuno Fidalgo, Dalila B. M. M. Fontes:
A simulation based decision aid tool for setting regulation of energy grids with distributed generation. Oper. Res. 11(1): 41-57 (2011) - [c7]Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions. GECCO 2011: 139-146 - [c6]Luís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem. SEA 2011: 327-339 - 2010
- [j7]Dalila B. M. M. Fontes:
Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks. INFOR Inf. Syst. Oper. Res. 48(1): 13-21 (2010) - [c5]Luís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem. IJCCI (ICEC) 2010: 332-339 - [c4]Paulo A. Pereira, Fernando A. C. C. Fontes, Dalila B. M. M. Fontes:
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems. OR 2010: 301-306
2000 – 2009
- 2009
- [c3]Dalila B. M. M. Fontes, José Fernando Gonçalves:
A Multi-population Genetic Algorithm for Tree-shaped Network Design Problems. IJCCI 2009: 177-182 - 2008
- [j6]Dalila B. M. M. Fontes:
Fixed versus flexible production systems: A real options analysis. Eur. J. Oper. Res. 188(1): 169-184 (2008) - 2007
- [j5]Dalila B. M. M. Fontes, José Fernando Gonçalves:
Heuristic solutions for general concave minimum cost network flow problems. Networks 50(1): 67-76 (2007) - [c2]Paulo A. Pereira, Fernando A. C. C. Fontes, Dalila B. M. M. Fontes:
A Decision Support System for Planning Promotion Time Slots. OR 2007: 147-152 - 2006
- [j4]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174(2): 1205-1219 (2006) - [j3]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems. J. Glob. Optim. 34(1): 97-125 (2006) - [j2]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
A Branch-and-Bound Algorithm for Concave Network Flow Problems. J. Glob. Optim. 34(1): 127-155 (2006) - 2005
- [c1]Marta S. R. Monteiro, Dalila B. M. M. Fontes:
Locating and Sizing Bank-Branches by Opening, Closing or Maintaining Facilities. OR 2005: 303-308 - 2003
- [j1]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. Networks 41(4): 221-228 (2003)
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-09-21 23:41 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:
