Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1038
PIRA download icon_1.1View/Download Full Text
Title: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
Authors: Nong, QQ
Ng, CTD 
Cheng, TCE 
Issue Date: Jan-2008
Source: Operations research letters, Jan. 2008, v. 36, no. 1, p. 61-66
Abstract: We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio of 5/2 for the non-identical job size model will be derived.
Keywords: Single-machine scheduling
Worst-case analysis
Approximation algorithm
Family
Batching
Publisher: Elsevier
Journal: Operations research letters 
ISSN: 0167-6377
EISSN: 1872-7468
DOI: 10.1016/j.orl.2007.01.007
Rights: Operations Research Letters © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
PTAS-family-batch.pdfPre-published version185.67 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

179
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

246
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

21
Last Week
0
Last month
0
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
0
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.