全文获取类型
收费全文 | 224篇 |
免费 | 89篇 |
国内免费 | 6篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 17篇 |
2013年 | 16篇 |
2012年 | 18篇 |
2011年 | 22篇 |
2010年 | 14篇 |
2009年 | 22篇 |
2008年 | 11篇 |
2007年 | 13篇 |
2006年 | 24篇 |
2005年 | 25篇 |
2004年 | 20篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有319条查询结果,搜索用时 484 毫秒
71.
在管道漏磁检测中,检测探头的提离效应对管道缺陷漏磁检测性能影响较大.在对漏磁检测探头提离效应影响因素分析的基础上,分析了管道漏磁检测探头提离效应影响特性;通过建立的模拟漏磁检测探头提离效应影响分析的实验装置系统,提取了传感器、磁化器在不同提离情况下的检测信号.根据实测数据,研究了漏磁检测过程中提离值对漏磁信号的影响趋势... 相似文献
72.
针对某特种车辆计算机控制系统对实时性的高要求,采用了TTCAN总线系统,为实现TTCAN系统的静态调度问题,提出了基于AL算法的改进算法——谐波周期算法,并通过MATLAB建立了系统的调度表。针对谐波周期算法的不足,结合该计算机控制系统的工作原理、信息传输的重要程度对静态调度表进行了适当的修改。通过与AL算法的对比分析,证实了改进的谐波周期算法在保证系统中周期型消息实时性能前提下,为非周期型信息获得了更大的传输带宽,又使系统信息传输的时间分配更加合理。 相似文献
73.
In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
74.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
75.
In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
76.
Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
77.
通过对维修调度问题进行分析,考虑到战斗力相关的多种目标因素,针对目前研究的目标单一,又未考虑武器的先进程度、配置等缺陷,就修复后的加权作战时间和装备尽可能少的延误数量双重目标加以研究,并给出了调度算法。从而弥补了这些缺陷,使调度更加合理。最后,算例表明模型的求解方法简单,计算时间较短,可有效地实现维修任务调度。 相似文献
78.
This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
79.
80.
管道热边界层减阻理论的应用研究 总被引:2,自引:2,他引:0
全面研究了高粘性液体管道流动的热边界层减阻理论的应用。利用管道热边界层理论中关于边界层的温度分布及层流、紊流时热边界层厚度的计算表达式,推证了管壁热流量及定性温度的计算表达式,利用指数型的粘温特性方程,采用积分方法推出了管道热边界层流动中层流和紊流摩擦水头损失的计算公式,并给出了设计应用实例。计算结果表明,对于高粘液体短管输送,其流动一般均为边界层入口段,热边界层减阻的最佳范围大致是管长L≤5km,管径D≤200mm。 相似文献