An efficient new heuristic for the hoist scheduling problem (Q342278)
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: An efficient new heuristic for the hoist scheduling problem |
scientific article; zbMATH DE number 6654131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient new heuristic for the hoist scheduling problem |
scientific article; zbMATH DE number 6654131 |
Statements
An efficient new heuristic for the hoist scheduling problem (English)
0 references
17 November 2016
0 references
transportation resources
0 references
dynamic scheduling
0 references
mixed integer linear programming (MILP)
0 references
heuristic
0 references
bounded processing times
0 references
initial products sequence
0 references
0 references
0.9389087
0 references
0.9010485
0 references
0 references
0.88714194
0 references
0.8842456
0 references
0.88181067
0 references
0.88009614
0 references
