The unbounded parallel batch machine scheduling with rejection

DOI10.3969/J.ISSN.1674-5043.2011.04.016MaRDI QIDQ2918197zbMATH OpenFDO

Authors Hui Chang, Bei Zhang

Publication date 5 October 2012

Published in Journal of Luoyang Institute of Science and Technology. Natural Science Edition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.1674-5043.2011.04.016

zbMATH Keywords

dynamic programmingbatch schedulingmaximum tardinessrejection scheduling

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(8)

• An unbounded batch scheduling with rejections
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• Parallel-batch scheduling on unrelated machines to minimize the sum objectives
• Bounded parallel-batch scheduling on unrelated parallel machines
• On scheduling an unbounded batch machine
• A note on unbounded parallel-batch scheduling

This page was built for publication: The unbounded parallel batch machine scheduling with rejection

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