Pages that link to "Item:Q2290581"
From MaRDI portal
The following pages link to Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581):
Displaying 5 items.
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots (Q1265862) (← links)
- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems (Q1988965) (← links)
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
- How to minimize cycle times of robot manufacturing systems (Q2139147) (← links)
- Makespan minimization for flow-shop problems with transportation times and a single robot (Q5946823) (← links)