An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

DOI10.1016/j.orl.2005.07.010zbMath1133.90340OpenAlexW2048804129MaRDI QIDQ2466598

Eugene Levner, Janny M. Y. Leung

Publication date: 15 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.07.010

zbMATH Keywords

polynomial algorithmsPCB manufacturingcyclic scheduleshoist-schedulingpartially-ordered sets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Scheduling multiple factory cranes on a common track ⋮ Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance ⋮ A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ Cyclic scheduling in robotic flowshops with bounded work-in-process levels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal quantity of operators for serving a homogeneous linear technological process
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Scheduling in robotic cells: Complexity and steady state analysis
• Minimizing the fleet size with dependent time-window and single-track constraints
• Cyclic scheduling in a robotic production line
• Minimizing the number of robots to meet a given cyclic schedule
• Current trends in deterministic scheduling
• Cyclic scheduling in robotic flowshops
• Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
• A Dual of Dilworth's Decomposition Theorem

This page was built for publication: An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times