The ability to respond quickly to customer demands is a key factor in successfully competing in today's globally competitive markets. Thus, meeting due dates could be the most important goal of scheduling in many manufacturing and service industries. Meeting due dates can naturally be translated into minimizing job tardiness. In this paper we present a priority rule for dynamic job shop scheduling that minimizes mean job tardiness. The rule is developed based on the characteristics of existing dispatching rules. With job due dates set by the generalized total work content rule, the computational results of simulation experiments show that the proposed dispatching rule consistently, and often, significantly outperforms a number of well-known priority rules in the literature. The proposed rule is also robust being the best or near-best rule for reducing the mean flowtime, for all the shop load levels and due date tightness factors tested.
An efficient priority rule for scheduling job shops to minimize mean tardiness
Log in via your institution
Log in to Taylor & Francis Online
Restore content access
Restore content access for purchases made as guestPDF download + Online access
- 48 hours access to article PDF & online version
- Article PDF can be downloaded
- Article PDF can be printed
Issue Purchase
- 30 days online access to complete issue
- Article PDFs can be downloaded
- Article PDFs can be printed
Related Research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.