Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop |
| |
Authors: | T. C. E. Cheng |
| |
Affiliation: | 1.Department of Actuarial and Management Sciences,University of Manitoba,Canada |
| |
Abstract: | This paper considers the problem of optimal assignment of total-work-content due-dates to n jobs and of sequencing them on a single machine to minimize an objective function depending on the assigned due-date multiple value and maximum tardiness penalty. It is shown that both the earliest due-date and shortest processing time orders yield an optimal sequence. A simple analytical solution method is presented to find the optimal due-dates. After the theoretical treatment an illustrative example is presented for discussion. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |