Pages that link to "Item:Q930594"
From MaRDI portal
The following pages link to Grouping techniques for scheduling problems: simpler and faster (Q930594):
Displayed 6 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)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Approximation Schemes for Robust Makespan Scheduling Problems (Q2806953) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)