Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16875
Title: Scheduling two job classes on parallel machines
Authors: Cheng, TCE 
Diamond, JE
Issue Date: 1995
Publisher: Taylor & Francis
Source: IIE transactions, 1995, v. 27, no. 5, p. 689-693 How to cite?
Journal: IIE transactions 
Abstract: The problem of scheduling n jobs on m parallel machines is considered where the jobs are partitioned into two priority classes. The objective is to minimize the total flowtime subject to the constraint that no job in the lower-priority class precedes any job in the higher-priority class that is assigned to the same machine. Conditions for feasibility are derived and used to develop a polynomially bounded dynamic programming algorithm that finds an optimal schedule.
URI: http://hdl.handle.net/10397/16875
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

3
Last Week
0
Last month
Citations as of May 16, 2017

Page view(s)

49
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check



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