Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions

Chung-Lun Li and Qingying Li
Additional contact information
Chung-Lun Li: The Hong Kong Polytechnic University, Hong Kong, China
Qingying Li: The Hong Kong Polytechnic University, Hong Kong, China

Journal of the Operational Research Society, 2015, vol. 66, issue 3, 516-523

Abstract: We consider the problem of scheduling a given set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a given release date and is compatible to only a subset of the machines. The machines are ordered and indexed in such a way that a higher-indexed machine can process all the jobs that a lower-indexed machine can process. We present a solution procedure to solve this problem in O(n2+mnlogn) time. We also extend our results to the tree-hierarchical processing sets case and the uniform machine case.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v66/n3/pdf/jors201422a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v66/n3/full/jors201422a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:66:y:2015:i:3:p:516-523

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().