scientific article; zbMATH DE number 5964914

MaRDI QIDQ3095030zbMATH OpenFDO

Authors Wei Ding, Yi Zhao

Publication date 28 October 2011

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol7/p551.html

zbMATH Keywords

heuristic algorithmLPT algorithmLS algorithmprocessorstight bound

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed
• Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Lower bound algorithms for multiprocessor task scheduling with ready times
• Performance of the LPT algorithm in multiprocessor scheduling
• An LPT-bound for a parallel multiprocessor scheduling problem
• Scheduling jobs on identical and uniform processors revisited
• A polynomial time approximation scheme for general multiprocessor job scheduling
• A fast algorithm for multi-machine scheduling problems with jobs of equal processing times

Cited in

(2)

• The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds
• An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095030)