Parametric precedence relations in single machine scheduling (Q916560)
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: Parametric precedence relations in single machine scheduling |
scientific article; zbMATH DE number 4154194
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parametric precedence relations in single machine scheduling |
scientific article; zbMATH DE number 4154194 |
Statements
Parametric precedence relations in single machine scheduling (English)
0 references
1990
0 references
The author considers a single machine scheduling problem with quadratic criterion function that involves completion times. A branch and bound algorithm is proposed, which is based on an adjacent precedence matrix concept. No computational results are given.
0 references
precedence relation
0 references
single machine scheduling
0 references
quadratic criterion
0 references
completion times
0 references
branch and bound algorithm
0 references
adjacent precedence matrix
0 references
0.9254316
0 references
0.92317915
0 references
0.9203341
0 references
0.9168408
0 references
0.90882313
0 references
0.9015708
0 references
