Similar Search Results

A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation

Homayouni, S. Mahdi; Fontes, Dalila B. M. M.; … - In: International Transactions in Operational Research 30 (2020) 2, pp. 688-716

Persistent link: https://www.econbiz.de/10012409388

A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation

Homayouni, S. Mahdi; Fontes, Dalila B. M. M.; … - In: International transactions in operational research : a … 30 (2023) 2, pp. 688-716

Persistent link: https://www.econbiz.de/10013417069

A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources

Fontes, Dalila B. M. M.; Homayouni, S. Mahdi; … - In: European journal of operational research : EJOR 306 (2023) 3, pp. 1140-1157

Persistent link: https://www.econbiz.de/10014279723

A Decision Support System for planning promotion time slots

Pereira, Paulo A.; Fontes, Fernando A.C.C.; Fontes, … - In: Operations research proceedings 2007 : selected papers …, (pp. 147-152). 2008

Persistent link: https://www.econbiz.de/10003717195

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

Fontes, Dalila B.M.M.; Hadjiconstantinou, Eleni; … - In: European Journal of Operational Research 174 (2006) 2, pp. 1205-1219

Persistent link: https://www.econbiz.de/10005253352

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

Fontes, Dalila B.M.M.; Hadjiconstantinou, Eleni; … - In: European journal of operational research : EJOR 174 (2006) 2, pp. 1205-1219

Persistent link: https://www.econbiz.de/10007285879

Solving Concave Network Flow Problems

Monteiro, Marta S.R.; Fontes, Dalila B.M.M.; Fontes, … - Faculdade de Economia, Universidade do Porto - 2012

The Minimum Cost Network Flow Problem (MCNFP) includes a wide range of combinatorial optimization problems. Many applications exist for MCNFPs for instance supply chains, logistics, production planning, communications and transportations. Concave costs are, in many applications, more realistic...

Persistent link: https://www.econbiz.de/10010842594

Solving Hop-constrained MST problems with ACO

Monteiro, Marta S.R.; Fontes, Dalila B.M.M.; Fontes, … - Faculdade de Economia, Universidade do Porto - 2013

The Hop-constrained Minimum cost Flow Spanning Tree (HMFST) problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. Given that we consider the total costs to be nonlinearly flow dependent with a fixed-charge...

Persistent link: https://www.econbiz.de/10010643582

Fixed versus flexible production systems: A real options analysis

Fontes, Dalila B.M.M. - In: European journal of operational research : EJOR 188 (2008) 1, pp. 169-184

Persistent link: https://www.econbiz.de/10007895273

A Branch-and-Bound Algorithm for Concave Network Flow Problems

Fontes, Dalila B.M.M.; Hadjiconstantinou, Eleni; … - In: Journal of global optimization : an international … 34 (2006) 1, pp. 127-156

Persistent link: https://www.econbiz.de/10007146037