A $1.25(1+\epsilon )$-Approximation Algorithm for Scheduling with Rejection Costs Proportional to Processing Times

This publication has 12 references indexed in Scilit:

• Single-machine scheduling with total late work and job rejection
  Computers & Industrial Engineering, 2022
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
  Journal of Combinatorial Optimization, 2020
• Scheduling with partial rejection
  Operations Research Letters, 2020
• An improved heuristic for parallel machine scheduling with rejection
  European Journal of Operational Research, 2015
• A survey on offline scheduling with rejection
  Journal of Scheduling, 2012
• A tabu search algorithm for order acceptance and scheduling
  Computers & Operations Research, 2012
• Order acceptance and scheduling: A taxonomy and review
  European Journal of Operational Research, 2011
• A 3/4-Approximation Algorithm for Multiple Subset Sum
  Journal of Heuristics, 2003
• On-line scheduling of unit time jobs with rejection: minimizing the total completion time
  Operations Research Letters, 2002
• Techniques for Scheduling with Rejection
  Lecture Notes in Computer Science, 1998