Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure (Q5184654): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.30.5.644 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013003733 / rank | |||
Normal rank | |||
Revision as of 20:08, 19 March 2024
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
