全文获取类型
收费全文 | 186篇 |
免费 | 11篇 |
出版年
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 7篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 3篇 |
2013年 | 27篇 |
2012年 | 2篇 |
2011年 | 6篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2001年 | 4篇 |
1999年 | 9篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1984年 | 3篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 4篇 |
1969年 | 3篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有197条查询结果,搜索用时 15 毫秒
131.
We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n2) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
132.
In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
133.
We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
134.
135.
In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(nm–2 log n) algorithm for the m-center problem where m ≥ 4. 相似文献
136.
A two-dimensional state space Markov Model of a Manpower System with special structure is analyzed. Examples are given from the military services. The probabilistic properties are discussed in detail with emphasis on computation. The basic equations of manpower stocks and flows are analyzed. 相似文献
137.
T. U. Zahle 《海军后勤学研究》1971,18(2):283-293
To find the hit probability for a series of correlated shots is, with conventional methods, a very tedious job even for the simplest statistical distributions. Experimental data, however, commonly show the shots lying chain-like on smooth curves about the target. For this case this paper introduces a new method of finding the hit probability without the use of correlation coefficients. The method is based on a transformation, where the target is transformed into a point and each bullet into an area the size of the target. 相似文献
138.
Consider a regulated monopolist whose current profits would be maximized if they could charge a price p?, where p? exceeds the current market price. By reducing production below current consumer demand the monopolist can create an illusion of a shortage and induce the regulator to allow a price increase. Conditions are given for which the production rate that maximizes the monopolist's expected discounted profits over an infinite horizon will have the property that the amount of unsatisfied consumer demand will be a non-increasing function of current market price. 相似文献
139.
Steven E. Shreve 《海军后勤学研究》1981,28(1):185-190
Let f1 and f2 map [0, T] into the real numbers. A system is following either f1 or f2 and earning the associated reward ∫ f1 or ∫ f2, respectively. It is possible at any time to switch from fi to fj by paying a switching cost b > 0. We determine a switching policy which maximizes the total reward. Conditions which guarantee a planning horizon are established. 相似文献
140.
In multi-commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two-commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K1, or K2, where max (K1, K2) ≤ K ≤ K1 + K2, This paper considers a two-commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering policies. 相似文献