Similar Search Results

New genetic algorithm approach for the min-degree constrained minimum spanning tree

Salgueiro, Rui; Almeida, Ana de; Oliveira, Orlando - In: European journal of operational research : EJOR 258 (2017) 3, pp. 877-886

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

Research trends in combinatorial optimization

Weinand, Jann Michael; Sörensen, Kenneth; San Segundo, … - In: International transactions in operational research : a … 29 (2022) 2, pp. 667-705

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

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

Ruiz, Efrain; Albareda-Sambola, Maria; Fernández, Elena; … - In: Computers & operations research : and their … 57 (2015), pp. 95-108

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

A two-level solution approach for solving the generalized minimum spanning tree problem

Pop, Petrică C.; Matei, Oliviu; Sabo, Cosmin; … - In: European journal of operational research : EJOR 265 (2018) 2, pp. 478-487

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

A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem

Singh, Kavita; Sundar, Shyam - In: European journal of operational research : EJOR 276 (2019) 1, pp. 88-105

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

Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility

Thevenin, Simon; Zufferey, Nicolas; Potvin, Jean-Yves - In: International journal of production research 55 (2017) 5/6, pp. 1588-1606

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

A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop

Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10

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

No-wait flowshop scheduling problem with two criteria : total tardiness and makespan

Allahverdi, Ali; Aydilek, Harun; Aydilek, Asiye - In: European journal of operational research : EJOR 269 (2018) 2, pp. 590-601

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

A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems

Chung, Chia-Shin; Flynn, James; Rom, Walter; … - 2013

The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA,...

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

A machine learning-based selection approach for solving the single machine scheduling problem with Early/Tardy jobs

Abdessemed, Ahmed-Adnane; Mouss, Leila Hayet; … - In: Bizinfo (Blace) : časopis iz oblasti ekonomije … 15 (2024) 1, pp. 1-10

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