全文获取类型
收费全文 | 84篇 |
免费 | 7篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 13篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 3篇 |
2009年 | 1篇 |
2008年 | 1篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有91条查询结果,搜索用时 256 毫秒
21.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
22.
In this paper, we consider a new weapon–target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model. We applied Lagrangian relaxation and a branch‐and‐bound method to the problem after transforming the nonlinear constraints into linear ones. An efficient primal heuristic is developed to find a feasible solution to the problem to facilitate the procedure. In the branch‐and‐bound method, three different branching rules are considered and the performances are evaluated. Computational results using randomly generated data are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 640–653, 1999 相似文献
23.
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998 相似文献
24.
The authors study a discrete-time, infinite-horizon, dynamic programming model for the replacement of components in a binary k-out-of-n failure system. (The system fails when k or more of its n components fail.) Costs are incurred when the system fails and when failed components are replaced. The objective is to minimize the long-run expected average undiscounted cost per period. A companion article develops a branch-and-bound algorithm for computing optimal policies. Extensive computational experiments find it effective for k to be small or near n; however, difficulties are encountered when n ≥ 30 and 10 ≤ k ≤ n − 4. This article presents a simple, intuitive heuristic rule for determining a replacement policy whose memory storage and computation time requirements are O(n − k) and O(n(n − k) + k), respectively. This heuristic is based on a plausible formula for ranking components in order of their usefulness. The authors provide sufficient conditions for it to be optimal and undertake computational experiments that suggest that it handles parallel systems (k = n) effectively and, further, that its effectiveness increases as k moves away from n. In our test problems, the mean relative errors are under 5% when n ≤ 100 and under 2% when k ≤ n − 3 and n ≤ 50. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 273–286, 1997. 相似文献
25.
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. 相似文献
26.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献
27.
This article investigates inference for pmax, the largest cell probability in multinomial trials for the case of a small to moderate number of trials. Emphasis focuses on point and interval estimation. Both frequentist and Bayesian approaches are developed. The results of extensive simulation investigation are included as well as the analysis of a set of crime data for the city of New Orleans taken from the National Crime Survey. 相似文献
28.
The maximum likelihood estimator of the service distribution function of an M/G/∞ service system is obtained based on output time observations. This estimator is useful when observation of the service time of each customer could introduce bias or may be impossible. The maximum likelihood estimator is compared to the estimator proposed by Mark Brown, [2]. Relative to each other, Brown's estimator is useful in light traffic while the maximum likelihood estimator is applicble in heavy trafic. Both estimators are compared to the empirical distribution function based on a sample of service times and are found to have drawbacks although each estimator may have applications in special circumstances. 相似文献
29.
30.
Jim Lee 《Defence and Peace Economics》2018,29(3):294-311
This paper empirically investigates the impact of military base realignments and closures on regional economic activity in light of the 2005 round of Base Realignment and Closure actions. Baseline regressions with county-level data show employment multipliers comparable to those generated from conventional input–output models. However, controlling for possible endogeneity and other regional-specific factors, regressions indicate more tenuous results for spillover effects from the military to the private sector. Only the contractor type of base employment generated economically and statistically meaningful impacts on local employment. In addition, there is strong evidence of asymmetric effects between military buildups and drawdowns. 相似文献