a genetic algorithm for solving scheduling problem
Publish Year: 1391
Type: Conference paper
Language: English
View: 1,561
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
Export:
Document National Code:
ICNMO01_114
Index date: 9 March 2013
a genetic algorithm for solving scheduling problem abstract
This paper considers a single machine family scheduling problem where jobs are partitioned into families and setup is required between these families. Theobjective is to find an optimal schedule that minimizes the total weighted completion time of the given jobs in the presence of the sequence independentfamily setup times. This problem has been proven to be strongly NP-hard. We introduce a genetic algorithm that employs an innovative crossover operator thatutilizes an undirected bipartite graph to find the best offspring solution among an exponentially large number of potential offspring. Computational results are presented. The proposed algorithm is shown to be superior when compared with other local search methods namely the dynamic length tabu search and randomized steepest descen
a genetic algorithm for solving scheduling problem Keywords:
a genetic algorithm for solving scheduling problem authors
habibeh nazif
payame noor university
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :