DocumentCode
352735
Title
Solving nonstandard job-shop scheduling problem with due dates using bounding genetic algorithm
Author
Haiying, Wang ; Fengru, Wang ; Qifeng, Liu
Author_Institution
Comput. & Control Coll., Harbin Univ. of Sci. & Technol., China
Volume
1
fYear
2000
fDate
2000
Firstpage
532
Abstract
According to the features of a non-standard job-shop scheduling problem with due dates, using the reverse scheduling policy, a initial algorithm based on priority values is presented in this paper, and the operators of the bounding genetic algorithm are constructed. Demonstration and judgement of the deadlock are also proposed. The experiment result shows that the algorithm presented is effective and can converge faster
Keywords
genetic algorithms; operations research; production control; bounding genetic algorithm; deadlock; due dates; job-shop; production control; scheduling; Educational institutions; Genetic algorithms; Processor scheduling; Scheduling algorithm; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
Conference_Location
Hefei
Print_ISBN
0-7803-5995-X
Type
conf
DOI
10.1109/WCICA.2000.860025
Filename
860025
Link To Document