Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24026
Title: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
Authors: Fu, R
Cheng, TCE 
Ng, CT 
Yuan, J
Keywords: Competitive ratio
Incompatible job families
Online scheduling
Parallel-batch machine
Issue Date: 2013
Source: Operations research letters, 2013, v. 41, no. 3, p. 216-219 How to cite?
Journal: Operations Research Letters 
Abstract: We consider the online scheduling of incompatible job families on an unbounded parallel-batch machine to minimize the makespan, where jobs arrive over time and the number of job families, f, is known in advance. We provide an optimal online algorithm for the problem with a competitive ratio of 1+4 f2+1-12f.
URI: http://hdl.handle.net/10397/24026
ISSN: 0167-6377
DOI: 10.1016/j.orl.2013.01.003
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
0
Last month
1
Citations as of Apr 22, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Apr 27, 2017

Page view(s)

48
Last Week
5
Last month
Checked on Apr 30, 2017

Google ScholarTM

Check

Altmetric



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