Pages that link to "Item:Q1265862"
From MaRDI portal
The following pages link to A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots (Q1265862):
Displaying 14 items.
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization (Q342414) (← 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)
- Algorithms for sequencing robot activities in a robot-centered parallel- processor workcell (Q1207209) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- The significance of reducing setup times/setup costs (Q2467248) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Quantitative production scheme model for an automated manufacturing system (Q4469968) (← links)
- Scheduling twin robots on a line (Q4632823) (← links)
- Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects (Q4868787) (← links)
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
