Abstract
For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due-date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.
| Original language | English |
|---|---|
| Pages (from-to) | 250-253 |
| Number of pages | 4 |
| Journal | European Journal of Operational Research |
| Volume | 37 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 1988 |
| Externally published | Yes |
Keywords
- convex programming
- Scheduling
ASJC Scopus subject areas
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management
Fingerprint
Dive into the research topics of 'An alternative proof of optimality for the common due-date assignment problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver