全文获取类型
收费全文 | 286篇 |
免费 | 127篇 |
国内免费 | 9篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 7篇 |
2020年 | 17篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 15篇 |
2016年 | 23篇 |
2015年 | 17篇 |
2014年 | 17篇 |
2013年 | 18篇 |
2012年 | 18篇 |
2011年 | 27篇 |
2010年 | 11篇 |
2009年 | 26篇 |
2008年 | 15篇 |
2007年 | 15篇 |
2006年 | 30篇 |
2005年 | 34篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 12篇 |
2001年 | 9篇 |
2000年 | 16篇 |
1999年 | 9篇 |
1998年 | 19篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
排序方式: 共有422条查询结果,搜索用时 15 毫秒
111.
112.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
113.
针对云平台上有向无环图科学应用执行容易产生虚拟机资源过剩、资源使用率低及费用虚高的问题,给出一种基于关键路径截取的有向无环图应用调度算法。该算法采取关键路径截取技术,循环找出最晚完成的未分配任务,从该任务出发,在所有未分配任务构成的图中找出最大连通子图,并计算该子图的关键路径,然后将关键路径上的任务集调度到性能匹配的虚拟机上执行;同时通过任务回填技术充分利用虚拟机的空闲时间槽,提高资源使用率。实验结果表明,在云计算平台上,该算法不仅能够在截止时间内完成有向无环图科学应用,而且可以提高资源使用率,有效减少完成该应用所需整体费用。 相似文献
114.
115.
在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。
关键词:天基预警系统、资源调度、形式化描述 相似文献
116.
Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations 下载免费PDF全文
We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014 相似文献
117.
针对孤立脉冲群电磁超声系统信号特征容易被噪声淹没的问题,提出基于改进的非负矩阵分解(INMF)优选特征的支持向量机(SVM)方法.首先,用3种不同的方法提取高维特征;其次,用NMF方法实现特征降维,并保证降维结果的唯一性,避免对特征的直接选择;最后,应用支持向量机方法对降维特征进行分类.对孤立脉冲群电磁超声系统采集的4种信号特征进行提取、选择和分类,实验结果表明:INMF方法能有效提取微弱信号的特征,减少运算量,提高电磁超声系统特征采集的准确率. 相似文献
118.
Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
119.
120.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献