Scheduling in robotic cells: process flexibility and cell layout
From MaRDI portal
Publication:3533187
DOI10.1080/00207540601100262zbMath1151.90411OpenAlexW2122385370MaRDI QIDQ3533187
Hakan Gultekin, M. Selim Akturk, Oya Ekin Karaşan
Publication date: 23 October 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23146
Related Items (5)
A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows ⋮ Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells ⋮ Pure cycles in flexible robotic cells ⋮ An analysis of cyclic scheduling problems in robot centered cells ⋮ Robotics and Control Systems
Cites Work
- Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
- Scheduling in a three-machine robotic flexible manufacturing cell
- Cyclic scheduling in 3-machine robotic flow shops
- Scheduling in robotic cells: Complexity and steady state analysis
- An efficient heuristic for robot acquisition and cell formation
- Scheduling large robotic cells without buffers
- Parallel machine scheduling with a common server
- Cyclic scheduling in robotic flowshops
- Robotic cell scheduling with operational flexibility
- Sequencing of robot activities and parts in two-machine robotic cells
- The machine layout problem in robot cells
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Cyclic Scheduling of Identical Parts in a Robotic Cell
This page was built for publication: Scheduling in robotic cells: process flexibility and cell layout
