Pages that link to "Item:Q1702663"
From MaRDI portal
The following pages link to LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663):
Displayed 6 items.
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Scheduling maintenance jobs in networks (Q1628599) (← links)
- A new LP rounding algorithm for the active time problem (Q2066698) (← links)
- Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)