A solution for cyclic scheduling of multi-hoists without overlapping
From MaRDI portal
Publication:2271830
DOI10.1007/s10479-008-0372-8zbMath1179.90170OpenAlexW2072080876MaRDI QIDQ2271830
Publication date: 4 August 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0372-8
overlappingmixed integer linear programmingbottleneckcyclic schedulingelectroplating linestwo hoist scheduling problem
Related Items (4)
Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ Scheduling multiple factory cranes on a common track ⋮ A generalized classification scheme for crane scheduling with interference
Uses Software
Cites Work
- Determining the optimal starting times in a cyclic schedule with a given route
- Minimizing the number of robots to meet a given cyclic schedule
- Single hoist cyclic scheduling with multiple tanks: A material handling solution
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
This page was built for publication: A solution for cyclic scheduling of multi-hoists without overlapping