Similar Search Results

Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources

Fanjul-Peyro, Luis; Perea, Federico; Ruiz, Rubén - In: European journal of operational research : EJOR 260 (2017) 2, pp. 482-493

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

Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

Fanjul-Peyro, Luis; Ruiz, Rubén; Perea, Federico - In: Computers & operations research : and their … 101 (2019), pp. 173-182

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

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

New hard benchmark for flowshop scheduling problems minimising makespan

Vallada, Eva; Ruiz, Rubén; Framinan, Jose M. - In: European journal of operational research : EJOR 240 (2015) 3, pp. 666-677

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

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

New hard benchmark for flowshop scheduling problems minimising makespan

Vallada, Eva; Ruiz, Rubén; Framinan, Jose M. - In: European Journal of Operational Research 240 (2015) 3, pp. 666-677

In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 jobs and 60 machines. One of the objectives of the...

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