Scheduling problems with rejection to minimize the maximum flow time

被引：0
|
作者：
Liqi Zhang
Lingfa Lu
机构：
[1] Henan Agricultural University,College of Information and Management Science
[2] Zhengzhou University,School of Mathematics and Statistics
来源：
Journal of Systems Science and Complexity | 2016年 / 29卷
关键词：
Approximation algorithm; NP-hard; rejection penalty; scheduling;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：1293 / 1301
页数：8
相关论文
共 50 条
12345