Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11793
Title: A minimum-cost network flow approach to preemptive parallel-machine scheduling
Authors: Su, LH
Cheng, TCE 
Chou, FD
Keywords: Minimum-cost network flow
Parallel machines
Preemptive jobs
Scheduling
Uniform machines
Issue Date: 2013
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2013, v. 64, no. 1, p. 453-458 How to cite?
Journal: Computers and industrial engineering 
Abstract: We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.
URI: http://hdl.handle.net/10397/11793
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2012.04.020
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
0
Citations as of Nov 6, 2018

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Nov 14, 2018

Page view(s)

62
Last Week
0
Last month
Citations as of Nov 12, 2018

Google ScholarTM

Check

Altmetric


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