Scheduling in reentrant robotic cells: algorithms and complexity
type: Item
instance of: scholarly article
title: Scheduling in reentrant robotic cells: algorithms and complexity
zbMATH Open document ID: 1123.90036
author: George Steiner
author: Zhihui Xue
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5153329
MaRDI profile type: Publication
full work available at URL: s10951-005-5314-6
OpenAlex ID: W2062601646
cites work: Scheduling of parts and robot activities in a two machine robotic cell
cites work: Cyclic Scheduling of Identical Parts in a Robotic Cell
cites work: Cyclic scheduling in robotic flowshops
cites work: Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
cites work: Q4198056
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
cites work: Scheduling in robotic cells: Complexity and steady state analysis
cites work: Makespan minimization for flow-shop problems with transportation times and a single robot
cites work: ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub
cites work: V-shop scheduling
cites work: A parametric critical path problem and an application for cyclic scheduling
cites work: Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects
cites work: On scheduling cycle shops: Classification, complexity and approximation
cites work: Scheduling large robotic cells without buffers
cites work: Minimizing Makespan in a Class of Reentrant Shops
DOI: 10.1007/S10951-005-5314-6
description: scientific article; zbMATH DE number 5153329