A Note on Scheduling Jobs with Equal Processing Times and Inclusive Processing Set Restrictions
SCIE
SSCI
SCOPUS
- Title
- A Note on Scheduling Jobs with Equal Processing Times and Inclusive Processing Set Restrictions
- Authors
- Li, CL; Lee, K
- Date Issued
- 2016-01
- Publisher
- PALGRAVE MACMILLAN LTD
- 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(n(2) + 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, logn} . n log n).
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/36322
- DOI
- 10.1057/JORS.2015.56
- ISSN
- 0160-5682
- Article Type
- Article
- Citation
- JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, vol. 67, no. 1, page. 83 - 86, 2016-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.