One scheduling problem with rejection

DOI10.3969/J.ISSN.1674-5043.2010.01.018MaRDI QIDQ3110610zbMATH OpenFDO

Authors Guanghua Wu, Li-Hua Yuan

Publication date 27 January 2012

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

zbMATH Keywords

approximation algorithmdynamic programmingscheduling with rejection

Mathematics Subject Classification ID

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

Recommendations

• Scheduling with Rejection to Minimize the Makespan
• Single machine scheduling with rejection to minimize the weighted makespan
• Scheduling with rejection to minimize the total weighted completion time
• Theory and Applications of Models of Computation
• Scheduling with rejection subject to release times and precedence constraints

Cited in

(10)

• A general scheme for solving a large set of scheduling problems with rejection in FPT time
• A greedy heuristic for solving scheduling problems with bounded rejection cost
• A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
• Scheduling with partial rejection
• Scheduling with rejection subject to release times and precedence constraints
• Scheduling with Rejection to Minimize the Makespan
• Scheduling with rejection to minimize the total weighted completion time
• Scheduling with rejection
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost
• Minimizing maximum delivery completion time for order scheduling with rejection

This page was built for publication: One scheduling problem with rejection

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