Scheduling with Rejection to Minimize the Makespan

DOI10.1007/978-3-642-02026-1_39zbMath1246.90067OpenAlexW1599177650MaRDI QIDQ3637088

Chengfei Wang, Jianfeng Ren, Yu-Zhong Zhang

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_39

zbMATH Keywords

dynamic programmingapproximation algorithmscheduling with rejectionworst case performance ratio

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) Approximation algorithms (68W25)

Related Items (8)

Two-agent parallel-machine scheduling with rejection ⋮ A survey on offline scheduling with rejection ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ The constrained parallel-machine scheduling problem with divisible processing times and penalties ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ Two-machine flow-shop scheduling with rejection ⋮ Multipurpose machine scheduling with rejection and identical job processing times

This page was built for publication: Scheduling with Rejection to Minimize the Makespan