Similar Search Results

Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic

M'Hallah, Rym; Al-Khamis, Talal - In: International journal of production research 50 (2012) 10, pp. 2639-2664

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

A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem

Fernandez-Viagas, Victor; Framinan, Jose M. - In: International journal of production research 53 (2015) 4, pp. 1111-1123

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

Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops

Yu, Jae-Min; Huang, Rong; Lee, Dong-ho - In: International journal of production research 55 (2017) 11/12, pp. 3266-3282

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

Emergency medical supplies scheduling during public health emergencies : algorithm design based on AI techniques

Xia, Huosong; Sun, Zelin; Wang, Yuan; Zhang, Zuopeng; … - In: International journal of production research 63 (2025) 2, pp. 628-650

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

An ant colonial optimisation approach for no-wait permutation flow shop scheduling

Khan, Ahitsham Shad; Jahanzaib, Mirza; Wasim, Ahmad; … - In: International journal of quality and innovation 3 (2017) 2/4, pp. 172-187

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

Comparison of some heuristic algorithms for the flow shop problem with parallel machines to minimize the total earliness, tardiness and waiting time

Janiak, Adam; Lichtenstein, Maciej - In: Operations research proceedings 2000 : selected papers …, (pp. 378-383). 2001

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

Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem

Saber, Reza Ghorbani; Ranjbar, Mohammad - In: Computers & operations research : and their … 138 (2022), pp. 1-11

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

Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion

Öztop, Hande; Tasgetiren, M. Fatih; Kandiller, Levent; … - In: Computers & operations research : and their … 138 (2022), pp. 1-20

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

Ring hierarchical hub network design problem : exact and heuristic solution methods

Eydi, Alireza; Khaleghi, Amir; Barzegar, Khaled - In: EURO journal on transportation and logistics 11 (2022), pp. 1-23

decomposition algorithm. Then, we present a hybrid genetic algorithm that uses the Dijkstra algorithm to evaluate solutions. Next …, we present a hybrid variable neighborhood search algorithm that uses the Dijkstra algorithm to calculate the cost of each … solution. Also, a relax-and-fix algorithm is proposed to find near-optimal feasible solutions for the problem. Computational …

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

Combinatorial Optimization Using Artificial Bee Colony Algorithm and Particle Swarm Optimization Supported Genetic Algorithm

Önder, Emrah - 2014

Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...

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