A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
From MaRDI portal
Publication:632670
DOI10.1016/j.cor.2010.11.008zbMath1208.90056OpenAlexW1996937503MaRDI QIDQ632670
Hongjian Hu, Michelle Chabrol, Ada Che, Michel Gourgand
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.11.008
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Automated systems (robots, etc.) in control theory (93C85)
Related Items
Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ Static force capability optimization of humanoids robots based on modified self-adaptive differential evolution ⋮ Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ A dynamic scheduling approach for optimizing the material handling operations in a robotic cell ⋮ A survey of scheduling problems with no-wait in process ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
Cites Work
- Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
- Scheduling in a three-machine robotic flexible manufacturing cell
- Sequencing and scheduling in robotic cells: recent developments
- A faster polynomial algorithm for 2-cyclic robotic scheduling
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- Identical part production in cyclic robotic cells: Concepts, overview and open questions
- Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
- A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
- A quadratic algorithm for the 2-cyclic robotic scheduling problem
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- Minimal quantity of operators for serving a homogeneous linear technological process
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Minimizing the fleet size with dependent time-window and single-track constraints
- Cyclic scheduling in a robotic production line
- Minimizing the number of robots to meet a given cyclic schedule
- A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
- Scheduling no-wait robotic cells with two and three machines
- Robotic cell scheduling with operational flexibility
- A polynomial algorithm for 2-degree cyclic robot scheduling
- Throughput optimization in robotic cells
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
- A Dual of Dilworth's Decomposition Theorem
- Part sequencing in three-machine no-wait robotic cells
