Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1838
Title: Scheduling unit-length jobs with machine eligibility restrictions
Authors: Li, CL 
Keywords: Scheduling
Machine eligibility restrictions
Unit-length jobs
Uniform machines
Issue Date: 16-Oct-2006
Publisher: Elsevier
Source: European journal of operational research, 16 Oct. 2006, v. 174, no. 2, p. 1325-1328 How to cite?
Journal: European Journal of Operational Research 
Abstract: We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.
URI: http://hdl.handle.net/10397/1838
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.03.023
Rights: European Journal of Operational Research © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
48 Final-Version.pdfPre-published version85.13 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

20
Last Week
0
Last month
0
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
0
Citations as of Sep 26, 2016

Page view(s)

298
Last Week
0
Last month
Checked on Sep 25, 2016

Download(s)

400
Checked on Sep 25, 2016

Google ScholarTM

Check

Altmetric



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