Similar Search Results

An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem

Pan, Quan-ke; Ruiz, Rubén - In: Omega : the international journal of management science 44 (2014), pp. 41-50

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

Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows

Pan, Quan Ke; Ruiz, Rubén; Alfaro-Fernández, Pedro - In: Computers & operations research : and their … 80 (2017), pp. 50-60

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

Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times

He, Xuan; Pan, Quan Ke; Gao, Liang; Neufeld, Janis S.; … - In: Omega : the international journal of management science 123 (2024), pp. 1-19

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

An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem

He, Xuan; Pan, Quan Ke; Gao, Liang; Neufeld, Janis S. - In: European journal of operational research : EJOR 310 (2023) 2, pp. 597-610

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

An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem

Pan, Quan-Ke; Ruiz, Rubén - In: Omega 44 (2014) C, pp. 41-50

In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one. Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show this behavior as it might be technically unfeasible or uneconomical to stop a machine...

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