Pages that link to "Item:Q1357782"
From MaRDI portal
The following pages link to Minimizing the number of robots to meet a given cyclic schedule (Q1357782):
Displaying 15 items.
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell (Q632670) (← links)
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (Q856208) (← links)
- Sequencing and scheduling in robotic cells: recent developments (Q880509) (← links)
- Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm (Q955949) (← links)
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots (Q1042101) (← links)
- Cyclic scheduling in a robotic production line (Q1347600) (← links)
- Vehicle minimization for periodic deliveries (Q1771353) (← links)
- How to minimize cycle times of robot manufacturing systems (Q2139147) (← links)
- A solution for cyclic scheduling of multi-hoists without overlapping (Q2271830) (← links)
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions (Q2434294) (← links)
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times (Q2466598) (← links)
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265) (← links)
- Makespan minimization in reentrant flow shop problem with identical jobs (Q6573405) (← links)
