Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27026
Title: On scheduling unbounded batch processing machine(s)
Authors: Liu, LL
Ng, CT 
Cheng, TCE 
Keywords: Batch processing
Computational complexity
Scheduling
Issue Date: 2010
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2010, v. 58, no. 4, p. 814-817 How to cite?
Journal: Computers and industrial engineering 
Abstract: The computational complexity of scheduling jobs with released dates on an unbounded batch processing machine to minimize total completion time and on parallel unbounded batch processing machines to minimize total weighted completion time remains open. In this note we show that the first problem is NP-hard with respect to id-encoding, and the second one is strongly NP-hard.
URI: http://hdl.handle.net/10397/27026
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2010.02.003
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Sep 9, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
1
Citations as of Sep 22, 2017

Page view(s)

45
Last Week
4
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



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