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(minm, log n s n log n).
- equal processing time jobs
- inclusive processing sets
- parallel machines
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research