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):
Displayed 10 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)
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)