An algorithm for hoist scheduling problems
From MaRDI portal
Publication:4394213
DOI10.1080/00207549408956949zbMath0903.90095OpenAlexW2012291522MaRDI QIDQ4394213
No author found.
Publication date: 11 June 1998
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549408956949
Related Items (10)
Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times ⋮ A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ Sequencing optimisation for makespan improvement at wet-etch tools ⋮ An efficient new heuristic for the hoist scheduling problem ⋮ A dynamic scheduling approach for optimizing the material handling operations in a robotic cell ⋮ On-line scheduling in a surface treatment system ⋮ A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints ⋮ Handling flexibility in a ``generalised job shop with a fuzzy approach ⋮ Single hoist cyclic scheduling with multiple tanks: A material handling solution
Cites Work
This page was built for publication: An algorithm for hoist scheduling problems