Using dispatching rules for job shop scheduling with due date-based objectives
Journal
Proceedings - IEEE International Conference on Robotics and Automation
Journal Volume
2006
Pages
1426 - 1431
Date Issued
2006
Date
2006
Author(s)
Chiang, Tsung-Che
Abstract
This paper addresses the job shop-scheduling problem with due date-based objectives including the tardy rate, mean tardiness and maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal of achieving a good and balanced performance when more than one objective is concerned at the same time. First, three good design principles are recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. Lastly, a comprehensive simulation study is conducted with the 18 existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and mean tardiness.
Event(s)
2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Subjects
Dispatching rules; Due dates; Jop shop; Scheduling
Other Subjects
Computational methods; Computer simulation; Product design; Scheduling; Dispatching rules; Due dates; Jop shops; Industrial research
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
61.pdf
Size
23.66 KB
Format
Adobe PDF
Checksum
(MD5):2b3a1f718120f5db52d20db2a640622c