全文获取类型
收费全文 | 331篇 |
免费 | 4篇 |
出版年
2023年 | 2篇 |
2021年 | 2篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 94篇 |
2011年 | 2篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1970年 | 2篇 |
1969年 | 4篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有335条查询结果,搜索用时 15 毫秒
251.
In a master surgery scheduling (MSS) problem, a hospital's operating room (OR) capacity is assigned to different medical specialties. This task is critical since the risk of assigning too much or too little OR time to a specialty is associated with overtime or deficit hours of the staff, deferral or delay of surgeries, and unsatisfied—or even endangered—patients. Most MSS approaches in the literature focus only on the OR while neglecting the impact on downstream units or reflect a simplified version of the real‐world situation. We present the first prediction model for the integrated OR scheduling problem based on machine learning. Our three‐step approach focuses on the intensive care unit (ICU) and reflects elective and urgent patients, inpatients and outpatients, and all possible paths through the hospital. We provide an empirical evaluation of our method with surgery data for Universitätsklinikum Augsburg, a German tertiary care hospital with 1700 beds. We show that our model outperforms a state‐of‐the‐art model by 43% in number of predicted beds. Our model can be used as supporting tool for hospital managers or incorporated in an optimization model. Eventually, we provide guidance to support hospital managers in scheduling surgeries more efficiently. 相似文献
252.
This paper describes the Value Added Analysis methodology which is used as part of the U.S. Army's Planning, Programming, Budgeting, and Execution System to assist the Army leadership in evaluating and prioritizing competing weapon system alternatives during the process of building the Army budget. The Value Added Analysis concept uses a family of models to estimate an alternative system's contribution to the Army's effectiveness using a multiattribute value hierarchy. A mathematical optimization model is then used to simultaneously determine an alternative's cost‐benefit and to identify an optimal mix of weapon systems for inclusion in the Army budget. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 233–253, 1999 相似文献
253.
Robert F. Dell James N. Eagle Gustavo Henrique Alves Martins Almir Garnier Santos 《海军后勤学研究》1996,43(4):463-480
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc. 相似文献
254.
We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. © 1995 John Wiley & Sons, Inc. 相似文献
255.
Because Pakistan has varying climates and terrains, the Pakistan Army rotates its units between peacetime locations so that no unit endures inequitable hardship or enjoys unfair advantage. Army policy specifies strict constraints on unit rotations, such as the length of a unit's stay in any location, the number of units moving at any time, and the allowable replacements for any moving unit. Scheduling rotations manually in accordance with these rules, as is currently practiced, is extremely difficult and time consuming. This article presents an integer programming model that finds feasible, minimum-cost schedules for the Pakistan Army's desired planning horizons. The model also ensures that the units are positioned at the end of the planning horizon so that feasible schedules exist for future planners. The model is implemented with commercially available optimization software. Schedules are obtained for realistic test problems in less than an hour on a personal computer. © 1995 John Wiley & Sons, Inc. 相似文献
256.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc. 相似文献
257.
Purchased materials often account for more than 50% of a manufacturer's product nonconformance cost. A common strategy for reducing such costs is to allocate periodic quality improvement targets to suppliers of such materials. Improvement target allocations are often accomplished via ad hoc methods such as prescribing a fixed, across‐the‐board percentage improvement for all suppliers, which, however, may not be the most effective or efficient approach for allocating improvement targets. We propose a formal modeling and optimization approach for assessing quality improvement targets for suppliers, based on process variance reduction. In our models, a manufacturer has multiple product performance measures that are linear functions of a common set of design variables (factors), each of which is an output from an independent supplier's process. We assume that a manufacturer's quality improvement is a result of reductions in supplier process variances, obtained through learning and experience, which require appropriate investments by both the manufacturer and suppliers. Three learning investment (cost) models for achieving a given learning rate are used to determine the allocations that minimize expected costs for both the supplier and manufacturer and to assess the sensitivity of investment in learning on the allocation of quality improvement targets. Solutions for determining optimal learning rates, and concomitant quality improvement targets are derived for each learning investment function. We also account for the risk that a supplier may not achieve a targeted learning rate for quality improvements. An extensive computational study is conducted to investigate the differences between optimal variance allocations and a fixed percentage allocation. These differences are examined with respect to (i) variance improvement targets and (ii) total expected cost. For certain types of learning investment models, the results suggest that orders of magnitude differences in variance allocations and expected total costs occur between optimal allocations and those arrived at via the commonly used rule of fixed percentage allocations. However, for learning investments characterized by a quadratic function, there is surprisingly close agreement with an “across‐the‐board” allocation of 20% quality improvement targets. © John Wiley & Sons, Inc. Naval Research Logistics 48: 684–709, 2001 相似文献
258.
259.
Robert Brathwaite 《Defence Studies》2016,16(4):327-345
The utilization of chemical weapons to quash domestic rebellion is a drastic action for a regime facing domestic challengers to take, especially given the reputation costs and risk of international intervention. However, recent developments have illustrated that some regimes have contemplated and implemented extraordinary measures (including the use of chemical munitions) to quash rebellion. This study addresses the question of why some states utilize chemical weapons against domestic challengers while others refrain from this level of state repression. I argue that the utilization of chemical weapons has both domestic and international elements. Specifically, that ethnic cleavages that lead to secessionist challenges and factors associated with inter-state rivalry impact the likelihood that a state utilizes the employment of chemical munitions. I test my argument and other explanations regarding repression with a casestudy approach utilizing captured Iraqi Government documents comparing Iraq’s Al-Anfal campaigns with developments during the recent Syrian Civil War. 相似文献
260.
In this article we present a proportional hazards model for describing machine tool failures. The model enables us to describe the effect of aging as well as the effect of the machining environment on tool life. We discuss inference for the model and show that computable results can be obtained in a fully Bayesian analysis by using approximation techniques. We illustrate the usefulness of our model by applying it to some actual data on machine tool failures. 相似文献