A note on scheduling jobs with equal processing times and inclusive processing set restrictions |
| |
| Authors: | Chung-Lun Li Kangbok Lee |
| |
| Institution: | 1.The Hong Kong Polytechnic University,Hung Hom,Hong Kong;2.York College, The City University of New York,Jamaica,USA |
| |
| 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). |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
