Similar Search Results

Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

Vallada, Eva; Villa, Fulgencia; Fanjul-Peyro, Luis - In: Computers & operations research : and their … 111 (2019), pp. 415-424

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

Iterated Greedy methods for the distributed permutation flowshop scheduling problem

Ruiz, Rubén; Pan, Quan Ke; Naderi, Bahman - In: Omega : the international journal of management science 83 (2018), pp. 213-222

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

An iterated greedy heuristic for a market segmentation problem with multiple attributes

Huerta-Muñoz, Diana L.; Ríos-Mercado, Roger Z.; Ruiz, … - In: European journal of operational research : EJOR 261 (2017) 1, pp. 75-87

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

A new vision of approximate methods for the permutation flowshop to minimise makespan : state-of-the-art and computational evaluation

Fernandez-Viagas, Victor; Ruiz, Rubén; Framinan, Jose M. - In: European journal of operational research : EJOR 257 (2017) 3, pp. 707-721

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

Local search methods for the flowshop scheduling problem with flowtime minimization

Pan, Quan-Ke; Ruiz, Rubén - In: European Journal of Operational Research 222 (2012) 1, pp. 31-43

Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively studied and many effective algorithms have been proposed in the last few...

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