DocumentCode
2942613
Title
A Virtual Preemption Paradigm for Using Priority Rules to Solve Job Shop Scheduling Problems
Author
Chiang, Tsung-Che ; Fu, Li-Chen
Author_Institution
Dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C. r88008@csie.ntu.edu.tw
fYear
2005
fDate
18-22 April 2005
Firstpage
3703
Lastpage
3708
Abstract
To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.
Keywords
Computer science; Constraint optimization; History; Job shop scheduling; Manufacturing industries; Processor scheduling; Production systems; Resource management; Semiconductor device manufacture; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 2005. ICRA 2005. Proceedings of the 2005 IEEE International Conference on
Print_ISBN
0-7803-8914-X
Type
conf
DOI
10.1109/ROBOT.2005.1570684
Filename
1570684
Link To Document