One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons

• 成果类型: Article
• 署名作者: Kanet, John J.
• 署名单位: University System of Ohio; University of Dayton
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2013.1253
• 发表日期: 2014
• 页码: 345-347
• 关键词: scheduling problem; weighted tardiness; algorithm

摘要

In 1969 H. Emmons provided three theorems (Emmons 1-3) for determining precedence relations between pairs of jobs for the single-machine tardiness problem. We show here a fourth straightforward theorem that uses the information when the jobs in the pair are both known to precede a third job in an optimum sequence. The new theorem augments the three Emmons theorems and is shown to be a generalization of a theorem by Elmaghraby.