全文获取类型
收费全文 | 227篇 |
免费 | 93篇 |
国内免费 | 14篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 11篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 23篇 |
2015年 | 18篇 |
2014年 | 19篇 |
2013年 | 21篇 |
2012年 | 32篇 |
2011年 | 33篇 |
2010年 | 12篇 |
2009年 | 20篇 |
2008年 | 10篇 |
2007年 | 14篇 |
2006年 | 24篇 |
2005年 | 19篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1991年 | 1篇 |
排序方式: 共有334条查询结果,搜索用时 234 毫秒
1.
备件库存和站点维修能力是影响备件维修周转的重要因素,制约装备使用效果。针对备件需求随任务阶段动态变化的装备保障方案评估和优化问题,考虑站点维修能力对备件维修过程的影响,结合METRIC建模方法和动态排队理论,建立了有限维修能力下多级保障系统装备时变可用度评估模型。在评估模型基础之上,以保障费用为优化目标,装备可用度为约束条件,建立了任务期内多级保障系统保障方案优化模型。以任务期内的最低可用度所对应的备件短缺数为观测值,分析了各项资源的边际效益值,采用边际优化算法对各项资源进行优化计算。算例分析表明,评估模型能够计算多级保障系统任务期内各阶段装备可用度;保障方案优化模型和方法能够得到各项保障资源的优化配置方案。提出的模型和优化方法能够为装备保障人员制定合理的保障方案提供决策支持。 相似文献
2.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献
3.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
4.
5.
分析了多阶段任务系统(PMS)可靠性分析中传统二元决策图(BDD)建模方法的不足,提出了一种将多阶段任务失效事件分解为互不相容的阶段失效事件,然后分别建立可靠性BDD模型的新方法。通过该方法建立的PMS可靠性BDD模型不但可以计算总体任务失效概率,同时也能计算任务在各阶段发生失效的概率。最后,给出了一个算例,验证了该算法的有效性。 相似文献
6.
7.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
8.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
9.
The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
10.
基于地空导弹(红方)对空中编队(蓝方)的拦截过程中的薄弱环节以及蓝方对红方实施的电子战措施的分析,对蓝方实施的电子战对红方拦截行动的影响进行了定量评估,得出蓝方突防概率与电子战综合作战效能之间的函数关系。仿真结果表明,对地空导弹拦截的每一环节都可以有效地实施电子战,削弱地空导弹的拦截能力。 相似文献