Pages that link to "Item:Q930594"
From MaRDI portal
The following pages link to Grouping techniques for scheduling problems: simpler and faster (Q930594):
Displaying 12 items.
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
- Group-based Pfair scheduling (Q853597) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- A group priority earliest deadline first scheduling algorithm (Q1762218) (← links)
- A reduction technique for weighted grouping problems (Q1848576) (← links)
- Approximation Schemes for Robust Makespan Scheduling Problems (Q2806953) (← links)
- Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
- (Q3115281) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- (Q4796706) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)