Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
Yükleniyor...
Tarih
2004
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Taylor & Francis Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage. This problem is of practical interest in the textile and process industries. A genetic algorithm (GA) is developed to solve the problem. The GA is tested against a lower bound from the literature as well as against heuristic rules on a test bed comprising 400 problems with up to 100 jobs, 10 stages, and with up to five processors on each stage. For small problems, solutions found by the GA are compared to optimal solutions, which are obtained by total enumeration. For larger problems, optimum solutions are estimated by a statistical prediction technique. Computational results show that the GA is both effective and efficient for the Current problem.
Açıklama
Anahtar Kelimeler
Multiprocessor Tasks, Hybrid Flow-shops, Make-span Minimization, Genetic Algorithms
Kaynak
Journal Of The Operational Research Society
WoS Q Değeri
Q3
Scopus Q Değeri
Q1
Cilt
55
Sayı
5
