Scheduling large robotic cells without buffers

DOI10.1023/A:1018952722784MaRDI QIDQ1383142zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

NP-hardtraveling salesmanmanufacturing systemrobotic cell

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)

Recommendations

• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Scheduling in robotic cells: Complexity and steady state analysis
• Scheduling in Robotic Cells: Heuristics and Cell Design
• Scheduling of parts and robot activities in a two machine robotic cell

Cited in

(25)

• Scheduling in reentrant robotic cells: algorithms and complexity
• Scheduling in robotic cells: process flexibility and cell layout
• On a scheduling problem in a robotized analytical system
• Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
• Cyclic scheduling of a 2-machine robotic cell with tooling constraints
• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• An optimization-based heuristic for the robotic cell problem
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
• Robotic cells: configurations, conjectures and cycle functions
• Cyclic hoist scheduling in large real-life electroplating lines
• Scheduling dual gripper robotic cell: one-unit cycles
• Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models
• scientific article; zbMATH DE number 4055357 (Why is no real title available?)
• Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
• A note on productivity gains in flexible robotic cells
• Robotic cell scheduling with operational flexibility
• Sequencing and scheduling in robotic cells: recent developments
• A review of TSP based approaches for flowshop scheduling
• A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
• Parallel machine scheduling with a common server
• Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells
• 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
• Robotic cells with parallel machines: throughput maximization in constant travel-time cells

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)