Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57185964, #quickstatements; #temporary_batch_1704715751507 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:43, 7 February 2024
scientific article; zbMATH DE number 2161374
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach |
scientific article; zbMATH DE number 2161374 |
Statements
Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (English)
0 references
26 April 2005
0 references
