Scheduling in reentrant robotic cells: algorithms and complexity

DOI10.1007/s10951-005-5314-6zbMath1123.90036OpenAlexW2062601646MaRDI QIDQ880491

George Steiner, Zhihui Xue

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-5314-6

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices

Cites Work

• Unnamed Item
• V-shop scheduling
• A parametric critical path problem and an application for cyclic scheduling
• Scheduling in robotic cells: Complexity and steady state analysis
• Scheduling of parts and robot activities in a two machine robotic cell
• Scheduling large robotic cells without buffers
• Cyclic scheduling in robotic flowshops
• On scheduling cycle shops: Classification, complexity and approximation
• Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Cyclic Scheduling of Identical Parts in a Robotic Cell
• Minimizing Makespan in a Class of Reentrant Shops
• Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Makespan minimization for flow-shop problems with transportation times and a single robot

This page was built for publication: Scheduling in reentrant robotic cells: algorithms and complexity