Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136)
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: Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness |
scientific article; zbMATH DE number 6633434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness |
scientific article; zbMATH DE number 6633434 |
Statements
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (English)
0 references
6 October 2016
0 references
scheduling
0 references
assignment problems
0 references
branch and bound
0 references
metaheuristics
0 references
fixed delivery dates
0 references
0 references
0 references
0 references
0 references
0.9701221
0 references
0.95552135
0 references
0.91875994
0 references
0.9180078
0 references
0.9176481
0 references
0.9170084
0 references
0.9151839
0 references
0.9151318
0 references
