Pages that link to "Item:Q2898056"
From MaRDI portal
The following pages link to Online Optimization of Busy Time on Parallel Machines (Q2898056):
Displaying 4 items.
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)