Abstract
This paper considers the problem of determining the optimal constant flow allowance for the CON due-date assignment method. A linear programming formulation of the problem is proposed and the optimal due-date is obtained by solving the LP dual problem.
| Original language | English |
|---|---|
| Pages (from-to) | 127-130 |
| Number of pages | 4 |
| Journal | Engineering Optimization |
| Volume | 9 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 1985 |
| Externally published | Yes |
Keywords
- duality theory
- due-date
- linear programming
ASJC Scopus subject areas
- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics