Pages that link to "Item:Q477193"
From MaRDI portal
The following pages link to Online optimization of busy time on parallel machines (Q477193):
Displaying 12 items.
- Optimizing busy time on parallel machines (Q476900) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Online over time processing of combinatorial problems (Q1617394) (← links)
- Randomized online algorithms for maximizing busy time interval scheduling (Q1909593) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- Online work-break problem and its competitive analysis (Q2809318) (← links)
- Minimizing busy time in multiple machine real-time scheduling (Q2908847) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- Maximizing the Throughput of Multiple Machines On-Line (Q5434381) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)