NP-HARD

作品数：93被引量：190H指数：6
导出分析报告
相关领域：自动化与计算机技术理学更多>>
相关作者：陈跃曲润涛李肯立李庆华黄川更多>>
相关机构：复旦大学上海交通大学中国科学院上海大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家高技术研究发展计划国家重点基础研究发展计划上海市科学技术发展基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 主题=SCHEDULINGx
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Single-Machine Scheduling with Step-Deteriorating Jobs and Rejection
《Journal of the Operations Research Society of China》2024年第4期1088-1102,共15页Fan-Yu Kong Cui-Xia Miao Yu-Jia Huo Jia-Xin Song Yu-Zhong Zhang 
supported by the National Natural Science Foundation of China(Nos.12271295 and 12001313);the Provincial Natural Science Foundation of Shandong(No.ZR2022MA019).
In this paper,we consider the single-machine scheduling with step-deteriorating jobs and rejection.Each job is either rejected by paying a rejection penalty,or accepted and processed on the single machine,and the actu...
关键词：SCHEDULING Step-deteriorating Rejection penalty NP-HARD Fully polynomial time approximation scheme 
Scheduling Problems with Rejection to Minimize the Maximum Flow Time
《Journal of Systems Science & Complexity》2016年第5期1293-1301,共9页ZHANG Liqi LU Lingfa 
supported by the National Nature Science Foundation of China under Grant Nos.11426094,11271338 and U1504103
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 ...
关键词：Approximation algorithm NP-HARD rejection penalty scheduling. 
Complexities of Some Problems on Multi-agent Scheduling on a Single Machine
《Journal of the Operations Research Society of China》2016年第3期379-384,共6页Jin-Jiang Yuan 
the National Natural Science Foundation of China(Nos.11271338 and 71301038);the National Natural Science Foundation of Henan Province(No.15IRTSTHN006).
We study the computational complexities of three problems on multi-agent scheduling on a single machine.Among the three problems,the computational complexities of the first two problems were still open and the last pr...
关键词：Multi-agent scheduling Competing agents Non-disjoint agents Unary NP-hard 
Algorithm Based on Taboo Search and Shifting Bottleneck for Job Shop Scheduling被引量：2
《Journal of Computer Science & Technology》2004年第6期776-781,共6页Wen-QiHuang ZhiHuang 
国家重点基础研究发展计划(973计划)
In this paper, a computational effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. It is based on taboo search procedure and on the shifting bottleneck procedure us...
关键词：SCHEDULING job shop NP-HARD HEURISTIC taboo search 
Approximation algorithm for multiprocessor parallel job scheduling被引量：1
《Journal of Central South University of Technology》2002年第4期267-272,共6页陈松乔 黄金贵 陈建二 
TheNationalNaturalScienceFoundationofChina(No.6 992 82 0 1) ;TheChangjiangScholarRewardProject.
P k |fix| C max problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP hard problem when k ≥3. This paper focuses on the case of k =3. Some new observations and new te...
关键词：MULTIPROCESSOR PARALLEL JOB SCHEDULING APPROXIMATION algorithm NP-HARD problem 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部