A note on a well-known dispatching rule to minimize total tardiness |
| |
| Institution: | 1. School of Management, Northwestern Polytechnical University, Xi''an 710072, China;2. Institute for Industrial Mathematics, Beer-Sheva 84641, Israel;3. Department of Computer Science, Holon Institute of Technology, Holon 58102, Israel;1. School of Computer Science, University of Lincoln, Lincoln LN6 7TS, UK;2. College of Information Science and Engineering, Northeastern University, Shenyang 110819, China;3. Department of Computer Science, Central China Normal University, Wuhan, China;4. School of Computer Science and Informatics, De Montfort University, Leicester LE1 9BH, UK;5. School of Computing, Newcastle University, Newcastle upon Tyne NE4 5TG, UK |
| |
| Abstract: | The single machine tardiness problem is considered. We clarify and correct an earlier result related to the Modified Due Date (MDD) Rule of Baker and Bertrand and show that a heuristic does not always satisfy an optimal sequence. However, we present some interesting special cases of optimal sequences that do satisfy the MDD Rule. We believe this note is important because the MDD Rule is still considered to be one of the most efficient rules to minimize the single machine tardiness problem. Because of its dispatching nature and simplicity, the MDD Rule is found to be very practical. It is widely applied in both static and dynamic job shop and industrial settings where setup times if any are negligible or included in the job processing times and hence not an issue. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
