An unbounded batch scheduling with rejections

MaRDI QIDQ3052565zbMATH OpenFDO

Authors Xianzhao Zhang, Zengxia Cai, Jianfeng Ren

Publication date 5 November 2010

zbMATH Keywords

NP-hardbatch schedulingpseudo-polynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The unbounded parallel batch machine scheduling with rejection
• Batch scheduling with job processing time compatibility and rejection on a single machine
• Single machine batch scheduling with rejection to minimize makespan
• 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

Cited in

(2)

• On scheduling an unbounded batch machine
• The unbounded parallel batch machine scheduling with rejection

This page was built for publication: An unbounded batch scheduling with rejections

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