On a single-machine optimal constant due-date assignment and sequencing problem (Q1110452)
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: On a single-machine optimal constant due-date assignment and sequencing problem |
scientific article; zbMATH DE number 4072693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a single-machine optimal constant due-date assignment and sequencing problem |
scientific article; zbMATH DE number 4072693 |
Statements
On a single-machine optimal constant due-date assignment and sequencing problem (English)
0 references
1988
0 references
This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.
0 references
optimal constant due-date assignment
0 references
sequencing of jobs
0 references
single-machine shop
0 references
general constrained optimization
0 references
Kuhn-Tucker conditions
0 references
optimal solution
0 references