Scheduling in reentrant robotic cells: algorithms and complexity

DOI10.1007/S10951-005-5314-6MaRDI QIDQ880491zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

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

Cites work

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

Cited in

(14)

• Scheduling reentrant jobs on parallel machines with a remote server
• Scheduling in robotic cells: Complexity and steady state analysis
• Scheduling of parts and robot activities in a two machine robotic cell
• Robotic cell scheduling with operational flexibility
• Scheduling a two-machine robotic cell: A solvable case
• 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
• Bicriteria robotic cell scheduling with controllable processing times
• Minimizing the number of grab's changes in a single machine scheduling problem
• scientific article; zbMATH DE number 1031409 (Why is no real title available?)
• New complexity results on scheduling problem in a robotic cell
• Scheduling in manufacturing with transportation: classification and solution techniques
• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880491)