Operational Research

, Volume 16, Issue 2, pp 211–221 | Cite as

The single machine serial batch scheduling problems with rejection

Original Paper


We consider several serial batch scheduling problems with rejection. Each job is either processed on a single serial batching machine or rejected by paying a penalty. We analyze two models with rejection. The first model is to minimize the sum of the scheduling cost of the accepted jobs and the total penalty of the rejected jobs, where the scheduling costs are the total completion time, the makespan, the maximum lateness and the weighted number of tardy jobs, respectively. For the former two problems, we propose two polynomial time algorithms to solve them. For the last two problems, we derive efficient dynamic programming algorithms. The second model is to minimize the makespan, given an upper bound on the total rejection cost, we present a fully polynomial time approximation scheme.


Scheduling Serial batching Rejection Dynamic programming 



The authors thank the anonymous reviewers for their helpful and detailed comments on an earlier version of our paper. This paper is supported by the National Natural Science Foundation of China (11201259) and the Doctoral Fund of the Ministry of Education (20123705120001 & 20123705110003).


  1. Bartal Y, Leonardi S, Spaccamela AM, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discret Math 13(1):64–78CrossRefGoogle Scholar
  2. Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and sequencing on a single machine. Oper Res 51(4):566–584Google Scholar
  3. Engels DW, Karger DR, Kolliopoulos SG, Sengupta S, Uma RN, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49(1):175–191CrossRefGoogle Scholar
  4. Guntzer MM, Jungnickel D (2000) Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem. Oper Res Lett 26(2):55–66CrossRefGoogle Scholar
  5. Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Prog 94(3):361–374CrossRefGoogle Scholar
  6. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Plenum Press, New York, pp 85–103Google Scholar
  7. Ng CT, Cheng TCE, Yuan JJ, Liu ZH (2003) On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper Res Lett 31(4):323–326CrossRefGoogle Scholar
  8. Sengupta S (2003) Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection. Lect Notes Comput Sci 2748:79–90CrossRefGoogle Scholar
  9. Shabtay D (2014) The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur J Oper Res 233(1):64–74CrossRefGoogle Scholar
  10. Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16(3):3–28CrossRefGoogle Scholar
  11. T’kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms. Springer, BerlinGoogle Scholar
  12. Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692–703CrossRefGoogle Scholar
  13. Xuan H, Li B (2013) Scheduling dynamic hybrid flow shop with serial batching machine. J Oper Res Soc 64(6):825–832CrossRefGoogle Scholar
  14. Yuan JJ, Yang AF, Cheng TCE (2004) A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. Eur J Oper Res 158(2):525–528CrossRefGoogle Scholar
  15. Zhang L, Lu L, Yuan J (2010) Single machine scheduling under the job rejection constraint. Theoret Comput Sci 411(16):1877–1882CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.School of Mathematical SciencesQufu Normal UniversityQufuChina

Personalised recommendations