A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem

A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem

The unrelated parallel machine scheduling problem aims to assign jobs to independent machines with sequence-dependent setup times so that the makespan is minimized. When many practical considerations are introduced, solving the resulting problem is challenging, especially when problems of realistic...

Täydet tiedot

Bibliografiset tiedot
Päätekijät: Dung-Ying Lin, Tzu-Yun Huang
Aineistotyyppi: Artikkeli
Kieli:English
Julkaistu: MDPI AG 2021-04-01
Sarja:Mathematics
Aiheet:
unrelated parallel machine scheduling
simulated annealing
variable neighborhood descent
metaheuristic
production scheduling
Linkit:https://www.mdpi.com/2227-7390/9/7/768

Internet

https://www.mdpi.com/2227-7390/9/7/768

Samankaltaisia teoksia