Minimizing total tardiness in an unrelated parallel-machine scheduling problem (Q5428943): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1057/palgrave.jors.2602141 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009709627 / rank | |||
Normal rank | |||
Latest revision as of 21:51, 19 March 2024
scientific article; zbMATH DE number 5215811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total tardiness in an unrelated parallel-machine scheduling problem |
scientific article; zbMATH DE number 5215811 |
Statements
Minimizing total tardiness in an unrelated parallel-machine scheduling problem (English)
0 references
29 November 2007
0 references
scheduling
0 references
unrelated parallel machines
0 references
total tardiness
0 references
branch and bound
0 references
