全文获取类型
收费全文 | 51篇 |
免费 | 1篇 |
出版年
2019年 | 1篇 |
2018年 | 1篇 |
2016年 | 1篇 |
2013年 | 8篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 1篇 |
2006年 | 1篇 |
2002年 | 1篇 |
2001年 | 1篇 |
1997年 | 2篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 4篇 |
1974年 | 1篇 |
1972年 | 1篇 |
1971年 | 2篇 |
1970年 | 1篇 |
1969年 | 3篇 |
1968年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有52条查询结果,搜索用时 15 毫秒
11.
12.
We schedule a set of illuminators (homing devices) to strike a set of targets using surface-to-air missiles in a naval battle. The task is viewed as a production floor shop scheduling problem of minimizing the total weighted flow time, subject to time-window job availability and machine downtime side constraints. A simple algorithm based on solving assignment problems is developed for the case when all the job processing times are equal and the data are all integer. For the general case of scheduling jobs with unequal processing times, we develop two alternate formulations and analyze their relative strengths by comparing their respective linear programming relaxations. We select the better formulation in this comparison and exploit its special structures to develop several effective heuristic algorithms that provide good-quality solutions in real time; this is an essential element for use by the Navy. © 1995 John Wiley & Sons, Inc. 相似文献
13.
Mathematical models are proposed for studying the impact of miscalibration upon operational effectiveness. Methodology for assessing the system effectiveness and an approach for optimizing the effectiveness of a calibration program are examined. The theory application is discussed and the results of some specific and convenient models are presented. 相似文献
14.
A model for geographically distributed combat interactions of swarming naval and air forces 下载免费PDF全文
This article describes the Distributed Interaction Campaign Model (DICM), an exploratory campaign analysis tool and asset allocation decision‐aid for managing geographically distributed and swarming naval and air forces. The model is capable of fast operation, while accounting for uncertainty in an opponent's plan. It is intended for use by commanders and analysts who have limited time for model runs, or a finite budget. The model is purpose‐built for the Pentagon's Office of Net Assessment, and supports analysis of the following questions: What happens when swarms of geographically distributed naval and air forces engage each other and what are the key elements of the opponents’ force to attack? Are there changes to force structure that make a force more effective, and what impacts will disruptions in enemy command and control and wide‐area surveillance have? Which insights are to be gained by fast exploratory mathematical/computational campaign analysis to augment and replace expensive and time‐consuming simulations? An illustrative example of model use is described in a simple test scenario. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 562–576, 2016 相似文献
15.
Donald D. Eisenstein 《海军后勤学研究》2008,55(4):350-362
Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
16.
We consider a multiperiod model in which limited resources are allocated among competing activities in each period. The objective is to minimize the maximum weighted deviation of the cumulative activity levels from the cumulative demands among all activities at all periods. All resources are assumed to be storable; that is, surpluses at one period can be used later on. This model is useful, for example, in multiperiod production planning for high-technology industries that assemble a large variety of circuit boards using numerous electronic components. The model is formulated with a minimax objective. We develop an efficient algorithm that can solve large-scale problems very quickly. At each iteration, the algorithm makes use of the solution to a relaxed problem to identify activities that should be permanently set to zero, as well as groups of activities that should have the same value. 相似文献
17.
Finite Markov processes are considered, with bidimensional state space, such that transitions from state (n, i) to state (m, j) are possible only if m ≤ n + 1. The analysis leads to efficient computational algorithms, to determine the stationary probability distribution, and moments of first passage times. 相似文献
18.
19.
Donald L. Iglehart 《海军后勤学研究》1975,22(3):553-565
The regenerative method for estimating parameters in a simulation requires the simulator to estimate the ratio of two means. Five point estimates and four confidence intervals for this ratio have been computed for three stochastic simulations. The jackknife method appears to be the most promising for both point and interval estimation. 相似文献
20.
A population of items which break down at random times and require repair is studied (the classic “machine repair problem with spares”). It is desired to determine the number of repair channels and spares required over a multiyear planning horizon in which population size and component reliability varies, and a service level constraint is imposed. When an item fails, a spare (if available) is immediately dispatched to replace the failed item. The failed item is removed, transported to the repair depot, repaired, and then placed in the spares pool (which is constrained to be empty not more than 10% of the time) unless there is a backlog of requests for spares, in which case it is dispatched immediately. The first model considered treats removal, transportation, and repair as one service operation. The second model is a series queue which allows for the separate treatment of removal, transportation, and repair. Breakdowns are assumed Poisson and repair times exponential. 相似文献