Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1038
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 
Keywords: Single-machine scheduling
Worst-case analysis
Approximation algorithm
Family
Batching
Issue Date: Jan-2008
Publisher: Elsevier
Source: Operations research letters, Jan. 2008, v. 36, no. 1, p. 61-66 How to cite?
Journal: Operations research letters 
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.
URI: http://hdl.handle.net/10397/1038
ISSN: 0167-6377
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
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of May 28, 2016

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of May 29, 2016

Page view(s)

408
Last Week
4
Last month
Checked on May 29, 2016

Download(s)

564
Checked on May 29, 2016

Google ScholarTM

Check

Altmetric



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