Pages that link to "Item:Q2405306"
From MaRDI portal
The following pages link to Busy time scheduling on a bounded number of machines (extended abstract) (Q2405306):
Displaying 9 items.
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time (Q1290163) (← links)
- Randomized online algorithms for maximizing busy time interval scheduling (Q1909593) (← 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)
- Minimizing busy time in multiple machine real-time scheduling (Q2908847) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)