Pages that link to "Item:Q5197263"
From MaRDI portal
The following pages link to An online algorithm for hierarchical scheduling on two identical machines with rejection (Q5197263):
Displaying 4 items.
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- Parallel machine scheduling with service hierarchy and rejection (Q5282528) (← links)