Scheduling large robotic cells without buffers
From MaRDI portal
Publication:1383142
DOI10.1023/A:1018952722784zbMATH Open0895.90109OpenAlexW179115048MaRDI QIDQ1383142FDOQ1383142
Authors: Nicholas G. Hall, Hichem Kamoun, Chelliah Sriskandarajah
Publication date: 2 April 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018952722784
Recommendations
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Cited In (25)
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
- Robotic cells with parallel machines: throughput maximization in constant travel-time cells
- Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models
- Scheduling in reentrant robotic cells: algorithms and complexity
- A note on productivity gains in flexible robotic cells
- A review of TSP based approaches for flowshop scheduling
- Title not available (Why is that?)
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
- Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
- Sequencing and scheduling in robotic cells: recent developments
- Cyclic scheduling of a 2-machine robotic cell with tooling constraints
- An optimization-based heuristic for the robotic cell problem
- Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells
- Scheduling in robotic cells: process flexibility and cell layout
- Robotics and Control Systems
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- Cyclic scheduling in 3-machine robotic flow shops
- On a scheduling problem in a robotized analytical system
- Robotic cells: configurations, conjectures and cycle functions
- Parallel machine scheduling with a common server
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
- Cyclic hoist scheduling in large real-life electroplating lines
- Robotic cell scheduling with operational flexibility
- Scheduling dual gripper robotic cell: one-unit cycles
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
This page was built for publication: Scheduling large robotic cells without buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383142)