Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A polynomial algorithm for 2-degree cyclic robot scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the number of robots to meet a given cyclic schedule / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Current trends in deterministic scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the fleet size with dependent time-window and single-track constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints / rank | |||
Normal rank | |||
Latest revision as of 10:30, 10 June 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
