首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   92篇
  免费   1篇
  2021年   1篇
  2020年   1篇
  2019年   4篇
  2018年   1篇
  2017年   6篇
  2016年   5篇
  2014年   1篇
  2013年   20篇
  2011年   1篇
  2010年   2篇
  2009年   1篇
  2007年   1篇
  2006年   2篇
  2005年   1篇
  2004年   3篇
  2003年   1篇
  2002年   5篇
  2000年   1篇
  1998年   2篇
  1994年   1篇
  1993年   3篇
  1992年   1篇
  1991年   2篇
  1989年   2篇
  1988年   3篇
  1985年   3篇
  1984年   1篇
  1983年   2篇
  1981年   1篇
  1980年   2篇
  1976年   1篇
  1975年   2篇
  1974年   2篇
  1973年   2篇
  1971年   3篇
  1969年   2篇
  1968年   1篇
排序方式: 共有93条查询结果,搜索用时 0 毫秒
81.
This paper derives optimal policies for when to hire, train, and lay off employees in service organizations when worker productivity appreciates deterministically or stochastically under constant, monotonic, and cyclic service demand. The model, an extension of the machine replacement problem from the engineering economy literature, uses infinite horizon linear programming to produce optimal personnel planning strategies and dual prices that characterize the workforce's economic value. The effect of employee attrition is also considered. In its valuation of human assets, unlike pure accounting approaches that only try to measure, this paper proposes an approach to capture the interaction between firm decisions pertaining to human resources and human resource value. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
82.
The historical and, to some extent, the current role of attribute inspection sampling in the United States Air Force is described. Some insight into consideration culminating in revisions made to the original MIL-STD-105 sampling plans is provided. These revisions were motivated from a practitioner's perspective rather than that of a statistical expert. Some significant administrative applications within the Air Force are described, and a practical method, based on the total amount of inspection, is given for distinguishing between sampling plans that have a fixed risk level (i.e., common value on the OC curves).  相似文献   
83.
It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model.  相似文献   
84.
The gradual covering problem   总被引:1,自引:0,他引:1  
In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
85.
In this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location problems.  相似文献   
86.
We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc.  相似文献   
87.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998  相似文献   
88.
In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000  相似文献   
89.
In this article we develop a class of general knapsack problems which are hard for branch and bound algorithms. The number of alternate optimal solutions for these problems grows exponentially with problem parameters. In addition the LP bound is shown to be ineffective. Computational tests indicate that these problems are truly difficult for even very small problems. Implications for the testing of algorithms using randomly generated problems is discussed.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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