Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines

DOI10.1007/978-3-642-14355-7_23zbMath1286.90063OpenAlexW1528839701MaRDI QIDQ3578377

Chengfei Wang, Cuixia Miao, Yu-Zhong Zhang

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_23

zbMATH Keywords

unrelated parallel machinesrejection penaltyparallel-batch schedulingpseudo-polynomial time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost ⋮ A survey on offline scheduling with rejection ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection

This page was built for publication: Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines