Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591)
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: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic |
scientific article; zbMATH DE number 5146810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total earliness and tardiness on a single machine using a hybrid heuristic |
scientific article; zbMATH DE number 5146810 |
Statements
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (English)
0 references
26 April 2007
0 references
scheduling
0 references
combinatorial optimization
0 references
hybrid heuristics
0 references
earliness
0 references
tardiness
0 references
single machine
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8422726392745972
0 references
0.8370586037635803
0 references
0.8278931975364685
0 references
0.8270148038864136
0 references
