Pages that link to "Item:Q880491"
From MaRDI portal
The following pages link to Scheduling in reentrant robotic cells: algorithms and complexity (Q880491):
Displaying 12 items.
- Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells (Q706905) (← links)
- Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models (Q976500) (← links)
- Scheduling reentrant jobs on parallel machines with a remote server (Q1010265) (← links)
- Scheduling in robotic cells: Complexity and steady state analysis (Q1296691) (← links)
- Scheduling of parts and robot activities in a two machine robotic cell (Q1302596) (← links)
- Robotic cell scheduling with operational flexibility (Q1765510) (← links)
- Scheduling a two-machine robotic cell: A solvable case (Q1897386) (← links)
- Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (Q2412847) (← links)
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775) (← links)
- Bicriteria robotic cell scheduling with controllable processing times (Q2997880) (← links)
- New complexity results on scheduling problem in a robotic cell (Q4603936) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
