Pages that link to "Item:Q4671265"
From MaRDI portal
The following pages link to Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265):
Displaying 9 items.
- Robust optimization for the cyclic hoist scheduling problem (Q300031) (← links)
- Scheduling multiple factory cranes on a common track (Q337056) (← links)
- Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm (Q955949) (← links)
- Optimal cyclic single crane scheduling for two parallel train oilcan repairing lines (Q1761100) (← links)
- A solution for cyclic scheduling of multi-hoists without overlapping (Q2271830) (← links)
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows (Q3163144) (← links)
- Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic (Q3163219) (← links)
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times (Q3163706) (← links)
- Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows (Q5058816) (← links)
