Dalila B. M. M. Fontes

Orcid: 0000-0002-9402-2088

According to our database1, Dalila B. M. M. Fontes authored at least 37 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Energy-efficient job shop scheduling problem with transport resources considering speed adjustable resources.
Int. J. Prod. Res., February, 2024

2023
A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation.
Int. Trans. Oper. Res., 2023

A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources.
Eur. J. Oper. Res., 2023

Job Deterioration Effects in Job-shop Scheduling Problems.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2023

A Hybrid BRKGA for Joint Scheduling Production, Transport, and Storage/Retrieval in Flexible Job Shops.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems.
J. Comb. Optim., 2022

A Multi-Population BRKGA for Energy-Efficient Job Shop Scheduling with Speed Adjustable Machines.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
Production and transport scheduling in flexible job shop manufacturing systems.
J. Glob. Optim., 2021

A MILP Model for Energy-Efficient Job Shop Scheduling Problem and Transport Resources.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2020
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem.
INFORMS J. Comput., 2020

2019
Joint production and transportation scheduling in flexible manufacturing systems.
J. Glob. Optim., 2019

A BRKGA for the integrated scheduling problem in FMSs.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018
A nonconvex quadratic optimization approach to the maximum edge weight clique problem.
J. Glob. Optim., 2018

Evaluating vehicle painting plans in an automobile assembly plant using an integrated AHP-PROMETHEE approach.
Int. Trans. Oper. Res., 2018

2017
New Formulations for the Unit Commitment Problem - Optimal Control and Switching-Time Parameterization Approaches.
Proceedings of the 14th International Conference on Informatics in Control, 2017

2015
The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach.
Optim. Lett., 2015

2014
Hop-Constrained Tree-Shaped Networks.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

A hybrid biased random key genetic algorithm approach for the unit commitment problem.
J. Comb. Optim., 2014

Poster city logistics: analyzing the impact of different public policies in the oporto city.
Proceedings of the 18th International Database Engineering & Applications Symposium, 2014

2013
A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks.
Optim. Lett., 2013

Concave minimum cost network flow problems solved with a colony of ants.
J. Heuristics, 2013

2012
BRKGA Adapted to Multiobjective Unit Commitment - Solving Pareto Frontier for UC Multiobjective Problem using BRKGA SPEA2 NPGA and NSGA II Techniques.
Proceedings of the ICORES 2012, 2012

An optimal control approach to the Unit Commitment problem.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
A simulation based decision aid tool for setting regulation of energy grids with distributed generation.
Oper. Res., 2011

A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks.
INFOR Inf. Syst. Oper. Res., 2010

A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems.
Proceedings of the Operations Research Proceedings 2010, 2010

2009
A Multi-population Genetic Algorithm for Tree-shaped Network Design Problems.
Proceedings of the IJCCI 2009, 2009

2008
Fixed versus flexible production systems: A real options analysis.
Eur. J. Oper. Res., 2008

2007
Heuristic solutions for general concave minimum cost network flow problems.
Networks, 2007

A Decision Support System for Planning Promotion Time Slots.
Proceedings of the Operations Research, 2007

2006
A Branch-and-Bound Algorithm for Concave Network Flow Problems.
J. Glob. Optim., 2006

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems.
J. Glob. Optim., 2006

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems.
Eur. J. Oper. Res., 2006

2005
Locating and Sizing Bank-Branches by Opening, Closing or Maintaining Facilities.
Proceedings of the Operations Research Proceedings 2005, 2005

2003
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems.
Networks, 2003


  Loading...