Skip to main content
Log in

An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Motivated by the existence of an APTAS (Asymptotic PTAS) for bin packing problem, we consider the batch scheduling problem with nonidentical job sizes to minimize makespan. For the proportional special version, i.e., there exists a fixed number α such that p j =α s j for every 1≤jn, we first present a lower bound of 3/2 for the approximation ratio and then design an APTAS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Azizoglu M, Webster S (2000) Scheduling a batch processing machine with non-identical job sizes. Int J Prod Res 38(10)

  • Brucker P, Gladky A, Hoogeveen H, Kovalyow MY, Potts CN, Tautenhahn T, van de Velde SL (1998) Scheduling a bathing machine. J Sched 1:31–54

    Article  MATH  MathSciNet  Google Scholar 

  • Deng XT, Poon CK, Zhang YZ (2003) Approximation algorithms in batch scheduling. J Comb Optim 7:247–257

    Article  MATH  MathSciNet  Google Scholar 

  • Deng XT, Feng HD, Zhang PX, Zhang YZ, Zhu H (2004) Minimizing mean completion time in batch processing system. Algorithmica 38(4):513–528

    Article  MATH  MathSciNet  Google Scholar 

  • Dupont L, Dhaenens-Flipo C (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput Oper Res 29:807–819

    Article  MATH  MathSciNet  Google Scholar 

  • Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within in linear time. Combinatorica 1(4):349–355

    Article  MATH  MathSciNet  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Ann Discrete Math 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  • Jolai Ghazvini F, Dupont L (1998) Minimizing mean flow times criteria on a single batch processing machine with nonidentical job sizes. Int J Prod Econ 55:273–280

    Article  Google Scholar 

  • Lenstra JK, Shmoys DR (1995) Computing near-optimal schedules. In: Chétienne P et al. (eds) Scheduling theory and its applications. Wiley, New York

    Google Scholar 

  • Li SG, Li GJ, Liu QM, Wang XL (2005) Minimizing makespan on a single batching machine with release times and non-identical jog sizes. Oper Res Lett 33:157–164

    Article  MATH  MathSciNet  Google Scholar 

  • Potts CN, Lovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249

    Article  MATH  Google Scholar 

  • Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615–1635

    Article  MATH  Google Scholar 

  • Zhang GC, Cai XQ, Lee CY, Wong CK (2001) Minimizing makespan on a single batch processing machine with non-identical job sizes. Nav Res Logist 48:226–247

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhigang Cao.

Additional information

Supported by NNSF of China (No.10671108).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Y., Cao, Z. An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan. J Comb Optim 16, 119–126 (2008). https://doi.org/10.1007/s10878-007-9128-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9128-7

Keywords

Navigation