Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure (Q5184654)
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: Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure |
scientific article; zbMATH DE number 3892916
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure |
scientific article; zbMATH DE number 3892916 |
Statements
Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure (English)
0 references
1984
0 references
quadratic penalty function
0 references
single machine
0 references
n-job sequencing
0 references
branch and bound procedure
0 references
enumeration tree
0 references
