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≤j≤n, we first present a lower bound of 3/2 for the approximation ratio and then design an APTAS.
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
Deng XT, Poon CK, Zhang YZ (2003) Approximation algorithms in batch scheduling. J Comb Optim 7:247–257
Deng XT, Feng HD, Zhang PX, Zhang YZ, Zhu H (2004) Minimizing mean completion time in batch processing system. Algorithmica 38(4):513–528
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
Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within in linear time. Combinatorica 1(4):349–355
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Ann Discrete Math 5:287–326
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
Lenstra JK, Shmoys DR (1995) Computing near-optimal schedules. In: Chétienne P et al. (eds) Scheduling theory and its applications. Wiley, New York
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
Potts CN, Lovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249
Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615–1635
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
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by NNSF of China (No.10671108).
Rights 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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9128-7