The minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines

zbMATH Open1340.90086MaRDI QIDQ3195877FDOQ3195877

Authors Cunchang Gu, Yuzhong Zhang

Publication date 28 October 2015

zbMATH Keywords

worst case ratiooff-line scheduling

Mathematics Subject Classification ID

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

Recommendations

• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• A note on minimizing the sum of quadratic completion times on two identical parallel machines
• An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
• Multi-machine scheduling with variance minimization
• Scheduling to minimize the maximum total completion time per machine

Cited in

(5)

• Minimizing the sum of job completion times on capacitated parallel machines
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• A note on scheduling to meet two min-sum objectives
• Total completion time minimization scheduling on two hierarchical uniform machines
• A note on minimizing the sum of quadratic completion times on two identical parallel machines

This page was built for publication: The minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines

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