Pages that link to "Item:Q1034625"
From MaRDI portal
The following pages link to Semi-online machine covering for two uniform machines (Q1034625):
Displaying 6 items.
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)