New precedence theorems for one-machine weighted tardiness

• 成果类型: Article
• 署名作者: Kanet, J. J.
• 署名单位: University System of Ohio; University of Dayton
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.1070.0255
• 发表日期: 2007
• 页码: 579-588
• 关键词: coordinating aggregate; job-shop; algorithm; minimize

摘要

In an earlier paper by Emmons [Emmons, H. 1969. One-machine sequencing to minimize certain functions of job tardiness. Oper Res. 17 701-715], the problem of sequencing jobs on a single machine in order to minimize total tardiness was analyzed. Emmons provided three theorems for specifying precedence relations for pairs of jobs. His theorems apply when the tardiness penalty for each job grows at the same rate. Rinnooy Kan et al. [Rinnooy Kan, A. H. G., B. J. Lageweg, J. K. Lenstra. 1975. Minimizing total costs in one-machine scheduling. Oper Res. 23 908-927] later extended Emmons's theorems to the case when job tardiness penalties can grow at different rates for different jobs. Provided here is a set of theorems, stronger than those of Rinnooy Kan et al., that more fully exploits the special properties of the weighted tardiness function, allowing for greater reduction of the solution space.