An efficient new heuristic for the hoist scheduling problem (Q342278): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2015.10.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2183641468 / rank | |||
Normal rank | |||
Revision as of 18:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient new heuristic for the hoist scheduling problem |
scientific article |
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
