Pages that link to "Item:Q3646206"
From MaRDI portal
The following pages link to POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206):
Displaying 4 items.
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488) (← links)
- Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs (Q3305474) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times (Q6535284) (← links)
