Bounded parallel-batch scheduling on unrelated parallel machines

DOI10.1007/978-3-642-14355-7_23MaRDI QIDQ3578377zbMATH OpenOpenAlexFDO

Authors Cuixia Miao, Chengfei Wang, Yuzhong 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

parallel-batch schedulingrejection penaltyunrelated parallel machinespseudo-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)

Recommendations

• Parallel-batch scheduling on unrelated machines to minimize the sum objectives
• The unbounded parallel batch machine scheduling with rejection
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection

Cited in

(17)

• Performance guarantees of jump neighborhoods on restricted related parallel machines
• 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
• scientific article; zbMATH DE number 6501083 (Why is no real title available?)
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Parallel-batch scheduling on unrelated machines to minimize the sum objectives
• On scheduling an unbounded batch machine
• Single machine unbounded parallel-batch scheduling with forbidden intervals
• Bag-Of-Tasks Scheduling on Related Machines
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• A note on unbounded parallel-batch scheduling
• Approximations and auctions for scheduling batches on related machines
• Unbounded parallel-batch scheduling with drop-line tasks
• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
• The unbounded parallel batch machine scheduling with rejection
• On lower and upper bounds for single machine parallel batch scheduling

This page was built for publication: Bounded parallel-batch scheduling on unrelated parallel machines

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