, Volume 14, Issue 2, pp 165–172 | Cite as

Parallel-machine scheduling with release dates and rejection

  • Liqi Zhang
  • Lingfa LuEmail author
Research paper


In this paper, we consider the parallel-machine scheduling problem with release dates and rejection. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on one of the m identical parallel machines. The objective is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. When m is a fixed constant, we provide a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the problem. When m is arbitrary, we present a 2-approximation algorithm for the problem.


Scheduling Rejection penalty Dynamic programming  FPTAS 

Mathematics Subject Classification




This research was supported in part by NSFC (11571321), NSFC (U1504103) and NSF-Henan (15IRTSTHN006).


  1. Bartal Y, Leonardi S, Spaccamela AM, Sgall J, Stougie L (2000) Multi-processor scheduling with rejection. SIAM J Discret Math 13:64–78CrossRefGoogle Scholar
  2. Cheng YS, Sun SJ (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194:18–27CrossRefGoogle Scholar
  3. Dosa G, He Y (2006) Scheduling with machine cost and rejection. J Comb Optim 12:337–350CrossRefGoogle Scholar
  4. Engels DW, Karger DR, Kolliopoulos SG, Sengupta S, Uma RN, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49:175–191CrossRefGoogle Scholar
  5. Epstein L, Noga J, Woeginger GJ (2002) On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper Res Lett 30:415–420CrossRefGoogle Scholar
  6. Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Program 94:361–374CrossRefGoogle Scholar
  7. Lawler EL (1973) Optimal sequencing a single machine subject to precedence constraints. Manag Sci 19:544–546CrossRefGoogle Scholar
  8. Lu LF, Ng CT, Zhang LQ (2011) Optimal algorithms for single-machine scheduling with rejection to minimize the makespan. Int J Prod Econ 130:153–158CrossRefGoogle Scholar
  9. Ma R, Yuan JJ (2013) On-line scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Inf Process Lett 113:593–598CrossRefGoogle Scholar
  10. Seiden S (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262:437–458CrossRefGoogle Scholar
  11. Shabtay D, Gaspar N, Kaspi M (2013) A survey on off-line scheduling with rejection. J Sched 16:3–28CrossRefGoogle Scholar
  12. Steiner G, Zhang R (2011) Revised delivery-time quotation in scheduling with tardiness penalties. Oper Res 59:1504–1511CrossRefGoogle Scholar
  13. Zhang LQ, Lu LF, Yuan JJ (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975–978CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.College of Information and Management ScienceHenan Agricultural UniversityZhengzhouPeople’s Republic of China
  2. 2.School of Mathematics and StatisticsZhengzhou UniversityZhengzhouPeople’s Republic of China

Personalised recommendations