Similar Search Results

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

Metaheuristic algorithms for the hybrid flowshop scheduling problem

Öztop, Hande; Tasgetiren, M. Fatih; Eliiyi, Deniz Türsel - In: Computers & operations research : and their … 111 (2019), pp. 177-196

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

A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation

Pan, Quan-ke; Wang, Ling; Li, Jun-qing; Duan, Jun-hua - In: Omega : the international journal of management science 45 (2014), pp. 42-56

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

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

A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation

Pan, Quan-Ke; Wang, Ling; Li, Jun-Qing; Duan, Jun-Hua - In: Omega 45 (2014) C, pp. 42-56

The hybrid flowshop scheduling (HFS) problem with the objective of minimising the makespan has important applications in a variety of industrial systems. This paper presents an effective discrete artificial bee colony (DABC) algorithm that has a hybrid representation and a combination of forward...

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