Minimizing the sum of squares lateness on a single machine (Q1848630): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A dual algorithm for the one-machine scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Single Machine Problem with a Quadratic Cost Function of Completion Times / 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 | |||
Revision as of 17:25, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the sum of squares lateness on a single machine |
scientific article |
Statements
Minimizing the sum of squares lateness on a single machine (English)
0 references
13 November 2002
0 references
Scheduling
0 references
Branch and Bound
0 references
