Pages that link to "Item:Q708204"
From MaRDI portal
The following pages link to Minimizing total busy time in parallel scheduling with application to optical networks (Q708204):
Displaying 9 items.
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Scheduling maintenance jobs in networks (Q1628599) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
