Abstract
This note considers the n-job, one-machine scheduling problem with common due-dates. Previous research has shown that the optimal value of the common due-date coincides with one of the job completion times for a given job sequence. In this note, we propose a linear programming (L.P.) formulation of the problem and obtain the same optimal result via considering the L.P. dual problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1089-1091 |
| Number of pages | 3 |
| Journal | Journal of the Operational Research Society |
| Volume | 37 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 1 Jan 1986 |
| Externally published | Yes |
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research
- Marketing