The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

MaRDI QIDQ2865880zbMATH OpenFDO

Authors Wei Ding

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/18367

zbMATH Keywords

approximate solutionsoptimal solutionsheuristic algorithmupper boundLPT algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• 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
• A scheduling problem on a general-purpose machine and many-group tasks with identical processors
• A type of scheduling problem on \(m\) general-purpose machinery and \(n\) group tasks with uniform processors
• scientific article; zbMATH DE number 5631796

Cited in

(4)

• An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed
• A scheduling problem on a general-purpose machine and many-group tasks with identical processors
• The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds
• A type of scheduling problem on \(m\) general-purpose machinery and \(n\) group tasks with uniform processors

This page was built for publication: The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

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