Scheduling large robotic cells without buffers

From MaRDI portal
Publication:1383142

DOI10.1023/A:1018952722784zbMath0895.90109OpenAlexW179115048MaRDI QIDQ1383142

Hichem Kamoun, Nicholas G. Hall, Chelliah Skriskandarajah

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




Related Items (21)

A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windowsOptimal cyclic scheduling of a hoist and multi-type parts with fixed processing timesA note on productivity gains in flexible robotic cellsCyclic hoist scheduling in large real-life electroplating linesCyclic scheduling of parts and robot moves in \(m\)-machine robotic cellsA branch and bound algorithm for the cyclic job-shop problem with transportationOn a scheduling problem in a robotized analytical systemScheduling in reentrant robotic cells: algorithms and complexitySequencing and scheduling in robotic cells: recent developmentsScheduling in robotic cells: process flexibility and cell layoutMinimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraintsRobotic cell scheduling with operational flexibilityApproximation algorithms for \(k\)-unit cyclic solutions in robotic cellsThroughput optimization in robotic cells with input and output machine buffers: a comparative study of two key modelsCyclic scheduling of a 2-machine robotic cell with tooling constraintsParallel machine scheduling with a common serverCyclic scheduling in 3-machine robotic flow shopsRobotics and Control SystemsAn optimization-based heuristic for the robotic cell problemA review of TSP based approaches for flowshop schedulingScheduling dual gripper robotic cell: one-unit cycles




This page was built for publication: Scheduling large robotic cells without buffers