The following pages link to (Q4537758):
Displayed 7 items.
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- Scheduling divisible loads with time and cost constraints (Q2066693) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)