全文获取类型
收费全文 | 174篇 |
免费 | 9篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 68篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有183条查询结果,搜索用时 15 毫秒
1.
2.
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
3.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
4.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness 下载免费PDF全文
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献
5.
In 2013, the staff of the U.S. Nuclear Regulatory Commission estimated the reduction of the off-site economic losses from a fire in a drained U.S. spent fuel pool if fuel that had cooled for more than five years were transferred to dry cask storage—an option it called “expedited transfer.” In this article, it is shown that the savings would be much higher than the NRC estimated. Savings increase to about $2 trillion if: losses beyond 50 miles are included; the land-contamination threshold for long-term population relocation is changed to that used for the Chernobyl and Fukushima accidents and recommended by the U.S. Environmental Protection Agency; and, based on the experience of Japan, decontamination of land areas to levels acceptable for population return is assumed to take at least four years. If expedited transfer were implemented, the off-site economic losses would be reduced by about 98%. 相似文献
6.
We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
7.
The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
8.
Sungil Kim Heeyoung Kim Jye‐Chyi Lu Michael J. Casciato Martha A. Grover Dennis W. Hess Richard W. Lu Xin Wang 《海军后勤学研究》2015,62(2):127-142
In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015 相似文献
9.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
10.
Michael J. Armstrong 《海军后勤学研究》2004,51(1):28-43
In the context of both discrete time salvo models and continuous time Lanchester models we examine the effect on naval combat of lethality: that is, the relative balance between the offensive and defensive attributes of the units involved. We define three distinct levels of lethality and describe the distinguishing features of combat for each level. We discuss the implications of these characteristics for naval decision‐makers; in particular, we show that the usefulness of the intuitive concept “more is better” varies greatly depending on the lethality level. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献