Pages that link to "Item:Q2819573"
From MaRDI portal
The following pages link to A PTAS for minimizing the weighted sum of job completion times on parallel machines (Q2819573):
Displaying 10 items.
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Scheduling Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
