DocumentCode
2181477
Title
Job-Shop Dynamic Scheduling Using Heuristic Immune Algorithm
Author
Huo, Hong ; Yang, Shao-Dong
Author_Institution
Sch. of Manage., Harbin Univ. of Commerce, Harbin, China
fYear
2009
fDate
20-22 Sept. 2009
Firstpage
1
Lastpage
5
Abstract
In view of the demands for production scheduling of modern manufacturing corporation, the Job-shop Dynamic Scheduling (JDS) model is originally set up based on the theory of resource optimization. Due to the complicated nature of the JDS, a framework Heuristic Immune Algorithm (HIA) for production scheduling is put forward. Finally, the method mentioned above is applied to solve the JDS of Shanghai Volksvagen, Automobile Co.Ltd., and the most optimal scheduling can be attained. The simulation results demonstrate that the Heuristic Immune Algorithm is feasible and effective for JDS.
Keywords
dynamic scheduling; job shop scheduling; optimisation; dynamic scheduling; heuristic immune algorithm; job shop scheduling; resource optimization theory; Business; Dynamic scheduling; Heuristic algorithms; Job shop scheduling; Manufacturing; Optimal scheduling; Optimized production technology; Processor scheduling; Resource management; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Management and Service Science, 2009. MASS '09. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4638-4
Electronic_ISBN
978-1-4244-4639-1
Type
conf
DOI
10.1109/ICMSS.2009.5305058
Filename
5305058
Link To Document