TY - GEN
T1 - A virtual preemption paradigm for using priority rules to solve job shop scheduling problems
AU - Chiang, Tsung Che
AU - Fu, Li Chen
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33846136422&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33846136422&partnerID=8YFLogxK
U2 - 10.1109/ROBOT.2005.1570684
DO - 10.1109/ROBOT.2005.1570684
M3 - Conference contribution
AN - SCOPUS:33846136422
SN - 078038914X
SN - 9780780389144
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 3703
EP - 3708
BT - Proceedings of the 2005 IEEE International Conference on Robotics and Automation
T2 - 2005 IEEE International Conference on Robotics and Automation
Y2 - 18 April 2005 through 22 April 2005
ER -