A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time

This paper presents the evaluation of two metaheuristics to solve the Unrelated Parallel Machine Scheduling Problem with Sequence Machine Dependent Setup Time. Considering such a problem, there is no relation between the time to process each task and the machine; and this is why the machines are ref...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Yayımlandı:Acta Scientiarum. Technology
Asıl Yazarlar: Everton Tozzo, Syntia Lemos Cotrim, Edwin Vladimir Cardoza Galdamez, Gislaine Camila Lapasini Leal
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: Universidade Estadual de Maringá 2018
Konular:
Ingeniería
metaheuristic
Scheduling problem
machine scheduling
Online Erişim:https://www.redalyc.org/articulo.oa?id=303258327051
https://www.redalyc.org/journal/3032/303258327051/
https://www.redalyc.org/journal/3032/303258327051/html/
https://www.redalyc.org/journal/3032/303258327051/303258327051.epub
https://www.redalyc.org/journal/3032/303258327051/movil
https://doi.org/10.4025/actascitechnol.v40i1.36607
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller