Abstract
This paper considers sequencing of n jobs on a single machine. The total-work-content (TWK) due-date assignment method is used to assign a due-date to each job. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the job earliness and tardiness values. A linear programming (LP) formulation of the problem is constructed and the optimal solution is determined via considering the LP dual problem.
| Original language | English |
|---|---|
| Pages (from-to) | 121-125 |
| Number of pages | 5 |
| Journal | Engineering Optimization |
| Volume | 14 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Nov 1988 |
| Externally published | Yes |
Keywords
- due-dates
- linear programming
- Manufacturing
- scheduling
ASJC Scopus subject areas
- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Determination of optimal total-work-content due-dates for a single machine sequencing problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver