Active schedules and a new hybrid genetic algorithm for the job shop scheduling problem

DSpace/Manakin Repository

Active schedules and a new hybrid genetic algorithm for the job shop scheduling problem

Show simple item record


dc.contributor.author Nguyen Huu, Mui
dc.contributor.author Vu Dinh, Hoa
dc.date.accessioned 2011-08-09T03:16:19Z
dc.date.available 2011-08-09T03:16:19Z
dc.date.issued 2011-08-09
dc.identifier.issn 0866-8612
dc.identifier.uri http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/14145
dc.description.abstract Active schedules and a new genetic algorithm for solving job shop scheduling problem are presented in this paper. In the proposed method, a chromosome representation of the problem is natural numbers, the GT algorithm is used to generate a set of active solutions, the mutation is implemented on the all machines concurrently. Especially, we propose a new crossover operator that combines the uniform crossover operator with GT algorithm and is implemented on 3 parents. The approach was tested on a set of benchmark programs and compared with other approaches. The computation results validated the effectiveness of the proposed algorithm. vi
dc.language.iso en_US vi
dc.relation.ispartofseries 213-221;
dc.subject Jobshop, Scheduling, Schedule, Genetic Algorithm. vi
dc.title Active schedules and a new hybrid genetic algorithm for the job shop scheduling problem vi
dc.type Article vi

Files in this item

Files Size Format View
Mui.pdf 78.88Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account