The following pages link to (Q3138949):
Displaying 10 items.
- New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
- A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
- An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
- On-line resource management with applications to routing and scheduling (Q4645187) (← links)
- Task scheduling in networks (Q5054769) (← links)
