Scheduling problems with rejection to minimize the maximum flow time |
| |
| Authors: | Liqi Zhang Lingfa Lu |
| |
| Institution: | 1.College of Information and Management Science,Henan Agricultural University,Zhengzhou,China;2.School of Mathematics and Statistics,Zhengzhou University,Zhengzhou,China |
| |
| Abstract: | This paper considers the scheduling problem with rejection on m identical parallel machines to minimize the maximum flow time. The authors show that this problem is NP-hard even when there is a single machine and all jobs have two distinct release dates. Furthermore, the authors present a dynamic programming algorithm and two approximation algorithms to solve them. |
| |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
