Similar Search Results

Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm

Xing, Yanfeng; Wang, Yansong - In: International journal of production research 50 (2012) 24, pp. 7303-7312

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

A graph-theoretic-based meta-heuristic algorithm for solving cooperative dynamic facility layout problems

Kheirkhah, Amir Saman; Bidgoli, Masume Messi - In: International journal of process management and … 8 (2018) 3, pp. 340-366

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

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

Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph

Tfaili, Sara; Dkhil, Hamdi; Sbihi, Abdelkader; Yassine, … - In: RAIRO / Operations research 53 (2019) 1, pp. 303-322

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

A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing

Yugma, Claude; Dauzère-Péres, Stéphane; Artigues, … - In: International journal of production research 50 (2012) 8, pp. 2118-2132

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

Solving the Minimum Independent Domination Set problem in graphs by exact algorithm and greedy heuristic

Laforest, Christian; Phan, Raksmey - In: RAIRO / Operations research 47 (2013) 3, pp. 199-221

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

Scalable Heuristic Algorithm for Identifying Critical Nodes in Networks

Purevsuren, Dalaijargal; Gombojav, Gantulga - 2023

This paper presents two heuristic algorithms for the distance-based critical node problem (DCNP) that finds k nodes whose removalminimizes the pairwise connection within D hops in the remaining network. The structural properties of complex networks havenot yet been extensively addressed in the...

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

Population-based iterated greedy algorithm for the S-labeling problem

Lozano, Manuel; Rodriguez-Tello, Eduardo - In: Computers & operations research : and their … 155 (2023), pp. 1-17

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

Ant Local Search and its efficient adaptation to graph colouring

Plumettaz, M.; Schindl, D.; Zufferey, Nicolas - In: Journal of the Operational Research Society : OR 61 (2010) 5, pp. 819-826

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

A comparison of heuristic best-first algorithms for bicriterion shortest path problems

Machuca, E.; Mandow, L.; Cruz, J. L. Pérez de la; … - In: European journal of operational research : EJOR 217 (2012) 1, pp. 44-53

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