首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   224篇
  免费   90篇
  国内免费   6篇
  2024年   1篇
  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篇
排序方式: 共有320条查询结果,搜索用时 15 毫秒
121.
非周期不完全检测下的维修优化   总被引:1,自引:0,他引:1       下载免费PDF全文
针对gamma退化型单部件系统,基于更新和半更新过程理论建立了以期望费用率最小为目标的非周期不完全检测下的维修优化模型。利用检测规划函数使系统的检测间隔期可以依据系统的状态进行调整。为更加贴近实际,模型考虑了测量误差对维修优化的影响。通过计算可以得到最优预防性维修阈值和检测方案。给出了模型的应用算例,通过对退化速率和费用参数的灵敏度分析说明了模型的有效性。与不考虑检测误差的优化结果进行对比,证明了考虑检测误差的重要性。  相似文献   
122.
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
123.
This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
124.
In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
125.
It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015  相似文献   
126.
为有效利用栅格化军事信息系统硬件冗余资源,提高系统运行时效,保证时敏军事任务执行效果,基于灰色理论的GM(1,1),提出了一种时敏军事任务调度模型。构建了基于主动式主/副本机制的调度流程,并针对普通(阈值)调度模型和模糊控制调度模型中调度触发的滞后和调度价值不确定的问题,设计了预测型调度时间窗口,有效优化了调度触发机制。最后通过仿真实验,考察了3种调度模型的有效性,结果表明模型虽然耗费了较大的调度开销,但在降低总体任务用时上作用明显。  相似文献   
127.
针对多功能相控阵雷达任务实时调度问题,提出了一种基于采样周期分区的时间资源调度算法(记为PD)。该算法以各类任务采样周期的最大公约数为分区标准,将各采样周期均分为多个等长区间,再将各类任务平均分配到不同分区中调度执行,可解决调度过程中任务因采样周期不同产生冲突的难题。仿真结果表明,该算法可提高系统任务调度能力,可广泛应用于相控阵雷达任务调度及其他实时任务调度系统。  相似文献   
128.
We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014  相似文献   
129.
In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014  相似文献   
130.
Lot splitting refers to breaking a production lot into smaller sublots during production. Coordinating lot splitting decisions across multiple stages of a production process is a challenging task. Traditional lot splitting and lot streaming models implicitly assume that the entire system is operated and owned by the same firm, or there exists a coordinator who controls the operation of all machines in the system. In this paper, we consider the situation where the machines in a multiple‐stage production process are owned and managed by different companies. Every item in a given production lot has to go through the processing by the supplier's machine, followed by the manufacturer's machine, and so on. We develop and analyze coordination mechanisms that enable different parties in the supply chain to coordinate their lot splitting decisions so as to achieve a systemwide optimum. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号