A heuristic algorithm of the Q//C_ problem on multi-tasks with uniform processors

MaRDI QIDQ3169508zbMATH OpenFDO

Authors Wei Ding

Publication date 29 September 2011

zbMATH Keywords

general-purpose machineryheuristic algorithmperformance indicesscheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A type of scheduling problem on m general-purpose machinery and n group tasks with uniform processors
• scientific article; zbMATH DE number 5631796
• A scheduling problem on a general-purpose machine and many-group tasks with identical processors
• scientific article; zbMATH DE number 989190
• The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds

Cited in

(4)

• 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
• scientific article; zbMATH DE number 989190 (Why is no real title available?)
• scientific article; zbMATH DE number 1559110 (Why is no real title available?)

This page was built for publication: A heuristic algorithm of the \(Q//C_{\max}\) problem on multi-tasks with uniform processors

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