The following pages link to (Q5371426):
Displaying 4 items.
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- A dispatching algorithm for parallel machines with rework processes (Q3582643) (← links)
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules (Q4642481) (← links)