TY - GEN
T1 - Using dispatching rules for job shop scheduling with due date-based objectives
AU - Chiang, Tsung Che
AU - Fu, Li Chen
PY - 2006
Y1 - 2006
N2 - This paper addresses the job shop scheduling problem with the due date-based objectives including the tardy rate, mean tardiness, and the maximum tardiness. The focused approach is dispatching rules. Sixteen dispatching rules are selected from the literature and used as the benchmarks. Their features and design concepts are also discussed. Then a dispatching rule is proposed with the goal as achieving good and balanced performance when more than one objective is concerned at the same time. The experimental results verified its superiority, especially on the tardy rate and mean tardiness.
AB - This paper addresses the job shop scheduling problem with the due date-based objectives including the tardy rate, mean tardiness, and the maximum tardiness. The focused approach is dispatching rules. Sixteen dispatching rules are selected from the literature and used as the benchmarks. Their features and design concepts are also discussed. Then a dispatching rule is proposed with the goal as achieving good and balanced performance when more than one objective is concerned at the same time. The experimental results verified its superiority, especially on the tardy rate and mean tardiness.
KW - Dispatching rules
KW - Job shop scheduling
UR - http://www.scopus.com/inward/record.url?scp=33845623418&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845623418&partnerID=8YFLogxK
U2 - 10.1109/ROBOT.2006.1641909
DO - 10.1109/ROBOT.2006.1641909
M3 - Conference contribution
AN - SCOPUS:33845623418
SN - 0780395069
SN - 9780780395060
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 1426
EP - 1431
BT - Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006
T2 - 2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Y2 - 15 May 2006 through 19 May 2006
ER -