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.
| Original language | English |
|---|---|
| Pages (from-to) | 177-181 |
| Number of pages | 5 |
| Journal | Journal of the Operational Research Society |
| Volume | 42 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 1991 |
| Externally published | Yes |
Keywords
- Due-date assignment
- Scheduling
- Sequencing
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research
- Marketing