Bounded parallel-batch scheduling on unrelated parallel machines
DOI10.1007/978-3-642-14355-7_23zbMATH Open1286.90063OpenAlexW1528839701MaRDI QIDQ3578377FDOQ3578377
Yuzhong Zhang, Chengfei Wang, Cuixia Miao
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
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
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (10)
- 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
- Title not available (Why is that?)
- 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
- Approximations and auctions for scheduling batches on related machines
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)
