Minimizing the number of robots to meet a given cyclic schedule
From MaRDI portal
Publication:1357782
DOI10.1023/A:1018980928352zbMATH Open0880.90075OpenAlexW32283066MaRDI QIDQ1357782
Publication date: 19 January 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018980928352
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (14)
How to minimize cycle times of robot manufacturing systems ⋮ Cyclic scheduling in a robotic production line ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ Sequencing and scheduling in robotic cells: recent developments ⋮ A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times ⋮ Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm ⋮ Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach ⋮ Vehicle minimization for periodic deliveries ⋮ A solution for cyclic scheduling of multi-hoists without overlapping ⋮ Makespan minimization in reentrant flow shop problem with identical jobs ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
This page was built for publication: Minimizing the number of robots to meet a given cyclic schedule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357782)
