A note on scheduling jobs with equal processing times and inclusive processing set restrictions

Chung-Lun Li and Kangbok Lee
Additional contact information
Chung-Lun Li: The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Kangbok Lee: York College, The City University of New York, Jamaica, NY, USA

Journal of the Operational Research Society, 2016, vol. 67, issue 1, 83-86

Abstract: We consider the problem of scheduling n jobs on m parallel machines with inclusive processing set restrictions. Each job has a given release date, and all jobs have equal processing times. The objective is to minimize the makespan of the schedule. Li and Li (2015) have developed an O(n2+mn log n) time algorithm for this problem. In this note, we present a modified algorithm with an improved time complexity of O(min{m, log n} ⋅ n log n).

Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v67/n1/pdf/jors201556a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v67/n1/full/jors201556a.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:67:y:2016:i:1:p:83-86

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 ().