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

Yuzhong Zhang and Zhigang Cao
Additional contact information
Yuzhong Zhang: Qufu Normal University

Journal of Combinatorial Optimization, 2008, vol. 16, issue 2, No 4, 119-126

Abstract: 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.

Keywords: Scheduling; Batching; Non-identical job sizes; Makespan; Asymptotic PTAS (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9128-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-007-9128-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9128-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().