Bounds on Schedules for Independent Tasks with Similar Execution Times
From MaRDI portal
Publication:3900980
Cited in
(4)- List scheduling algorithms to minimize the makespan on identical parallel machines
- A state-of-the-art review of parallel-machine scheduling research
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
- Semi-online scheduling with bounded job sizes on two uniform machines
This page was built for publication: Bounds on Schedules for Independent Tasks with Similar Execution Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3900980)