Parallel-batch scheduling on unrelated machines to minimize the sum objectives

zbMATH Open1240.90155MaRDI QIDQ3170977FDOQ3170977

Chengfei Wang, Cuixia Miao, Yuzhong Zhang

Publication date: 29 September 2011

Recommendations

• Bounded parallel-batch scheduling on unrelated parallel machines
• Minimizing total weighted completion time on parallel unbounded batch machines
• Serial batch scheduling on uniform parallel machines to minimize total completion time
• The unbounded parallel batch machine scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

zbMATH Keywords

parallel-batch schedulingrejection penaltyunrelated parallel machinespseudo-polynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

This page was built for publication: Parallel-batch scheduling on unrelated machines to minimize the sum objectives

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