Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20967
Title: Note on hierarchical minimization of flowtimes on parallel-machines
Authors: Cheng, TCE 
Diamond, JE
Issue Date: 1994
Publisher: Taylor & Francis
Source: IIE transactions, 1994, v. 26, no. 2, p. 109-111 How to cite?
Journal: IIE transactions 
Abstract: We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided into p priority classes and the total flowtime of the class with the k-th highest priority is the k-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.
URI: http://hdl.handle.net/10397/20967
ISSN: 0740-817X
EISSN: 1545-8830
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Oct 17, 2017

Page view(s)

51
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check



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