Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22472
Title: Scheduling groups of unit length jobs on two identical parallel machines
Authors: Liu, Z
Yu, W
Cheng, TCE 
Issue Date: 1999
Publisher: Elsevier Science Publishers B.V.
Source: Information processing letters, 1999, v. 69, no. 6, p. 275-281 How to cite?
Journal: Information Processing Letters 
Abstract: The problem of scheduling groups of unit length jobs with group sub-lotting on two identical parallel machines to minimize the total completion time is known to be NP-hard. In this paper, we present a pseudopolynomial-time algorithm for the problem, thus establishing that the problem is NP-hard in the ordinary sense. We also show that the problem remains NP-hard even for the case with any fixed positive set-up time.
URI: http://hdl.handle.net/10397/22472
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(99)00026-5
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

8
Last Week
0
Last month
1
Citations as of Apr 15, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
1
Citations as of Mar 31, 2017

Page view(s)

35
Last Week
1
Last month
Checked on Apr 16, 2017

Google ScholarTM

Check

Altmetric



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