全文获取类型
收费全文 | 569篇 |
免费 | 22篇 |
国内免费 | 1篇 |
出版年
2021年 | 7篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 113篇 |
2012年 | 6篇 |
2011年 | 8篇 |
2010年 | 6篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1997年 | 7篇 |
1996年 | 14篇 |
1995年 | 5篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 17篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 14篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 6篇 |
1976年 | 11篇 |
1975年 | 11篇 |
1974年 | 9篇 |
1973年 | 10篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 12篇 |
1969年 | 6篇 |
1968年 | 9篇 |
1967年 | 7篇 |
排序方式: 共有592条查询结果,搜索用时 0 毫秒
151.
John G. Rau 《海军后勤学研究》1971,18(4):543-559
A mathematical model is developed that enables organization and manpower planners to quantify the inefficiencies involved in rapid buildups of organizations, such as is frequently found in the aerospace industry shortly after the award of a major contract. Consideration is given to the time required to train, indoctrinate, and familiarize new workers with their jobs and the general program aspects. Once trained, workers are assumed to be productive. If the ratio of untrained to trained workers exceeds a critical value, called the buildup threshold, then the performance of the trained workers is degraded to the extent that they are no longer 100 percent efficient until this ratio returns to a value less than the threshold. The model is sufficiently general to consider an arbitrary manpower plan with more than one peak or valley. The model outputs are functions of real time and consist of the fraction of the total labor force which is productive, the fraction of the total labor units expended for nonproductive effort, the cumulative labor costs for productive effort, and the cumulative labor cost for all effort. 相似文献
152.
Several approximate procedures are available in the literature for obtaining confidence intervals for the parameter A of an exponential distribution based on time truncated samples. This paper contains the results of an empirical study comparing three of these procedures. 相似文献
153.
154.
155.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
156.
A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small- to moderate-sized randomly generated generalized set-packing models. Solutions are compared to those obtained using an existing well-regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low-density models in which the number of variables is large relative to the number of constraints. 相似文献
157.
158.
We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
159.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
160.
The optimality of the One‐Bug‐Look‐Ahead (OLA) software release policy proposed by Morali and Soyer ( 15 ) is re‐examined in this paper. A counterexample is constructed to show that OLA is not optimal in general. The optimal stopping approach is then called upon to prove that OLA possesses weaker sense of optimality under conditional monotonicity and the strong sense of optimality holds under a more restrictive sample‐wise monotonicity condition. The NTDS data are analyzed for illustration, and OLA is shown to be robust with respect to model parameters. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献