Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23082
Title: On the complexity of bi-criteria scheduling on a single batch processing machine
Authors: Liu, LL
Ng, CT 
Cheng, TCE 
Keywords: Batch processing
Bi-criteria
Complexity
Scheduling
Issue Date: 2010
Source: Journal of scheduling, 2010, v. 13, no. 6, p. 629-638 How to cite?
Journal: Journal of Scheduling 
Abstract: This paper considers hierarchical bi-criteria scheduling on a single batch processing machine where the primary criterion is the makespan. We show that the problem where the secondary criterion is the total completion time can be solved in polynomial time for a given machine capacity and the problem where the secondary criterion is the (weighted) number of late jobs is (strongly) NP-hard.
URI: http://hdl.handle.net/10397/23082
ISSN: 1094-6136
DOI: 10.1007/s10951-010-0180-2
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of May 26, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of May 29, 2017

Page view(s)

36
Last Week
0
Last month
Checked on May 28, 2017

Google ScholarTM

Check

Altmetric



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