Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach (Q3912340): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02522667.1981.10698693 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021195025 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution / rank | |||
Normal rank | |||
Latest revision as of 12:28, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach |
scientific article |
Statements
Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach (English)
0 references
1981
0 references
single machine scheduling
0 references
branch-and-bound procedure
0 references
minimization of a total quadratic penalty function
0 references
minimization of completion time
0 references
