An alternative proof of optimality for the common due-date assignment problem (Q1107429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An alternative proof of optimality for the common due-date assignment problem |
scientific article; zbMATH DE number 4064753
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative proof of optimality for the common due-date assignment problem |
scientific article; zbMATH DE number 4064753 |
Statements
An alternative proof of optimality for the common due-date assignment problem (English)
0 references
1988
0 references
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.
0 references
n-job, one-machine scheduling
0 references
common due-dates
0 references
alternative proof
0 references
Kuhn- Tucker's optimality conditions
0 references
constrained convex programming
0 references
0 references
