全文获取类型
| 收费全文 | 251篇 |
| 免费 | 0篇 |
专业分类
| 251篇 |
出版年
| 2021年 | 1篇 |
| 2020年 | 1篇 |
| 2019年 | 7篇 |
| 2018年 | 5篇 |
| 2017年 | 5篇 |
| 2016年 | 12篇 |
| 2015年 | 14篇 |
| 2014年 | 8篇 |
| 2013年 | 68篇 |
| 2012年 | 9篇 |
| 2011年 | 7篇 |
| 2010年 | 5篇 |
| 2009年 | 7篇 |
| 2008年 | 9篇 |
| 2007年 | 12篇 |
| 2006年 | 7篇 |
| 2005年 | 11篇 |
| 2004年 | 8篇 |
| 2003年 | 13篇 |
| 2002年 | 12篇 |
| 2001年 | 6篇 |
| 2000年 | 7篇 |
| 1999年 | 6篇 |
| 1998年 | 1篇 |
| 1997年 | 1篇 |
| 1995年 | 1篇 |
| 1994年 | 2篇 |
| 1993年 | 2篇 |
| 1992年 | 1篇 |
| 1990年 | 1篇 |
| 1989年 | 1篇 |
| 1983年 | 1篇 |
排序方式： 共有251条查询结果，搜索用时 0 毫秒
151.
In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
152.
We consider in this paper the coordinated replenishment dynamic lot‐sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts needs to be considered as well. The mathematical programming formulation for the incremental discount version of the extended problem and a tighter reformulation of the problem based on variable redefinition are provided. These then serve as the basis for the development of a primal‐dual based approach that yields a strong lower bound for our problem. This lower bound is then used in a branch and bound scheme to find an optimal solution to the problem. Computational results for this optimal solution procedure are reported in the paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 686–695, 2000 相似文献
153.
Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
154.
An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
155.
K.‐J. Müller 《战略研究杂志》2013,36(2):123-152
156.
This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001 相似文献
157.
Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure. 相似文献
158.
Cardiovascular diseases (CVDs) are the leading cause of death and disability both in the United States and worldwide. Despite high morbidity, mortality, and cost in the United States and global healthcare systems, cardiovascular care has been understudied in the healthcare operations management literature. In this paper, we identify research opportunities for healthcare operations management scholars to aid in improving cardiovascular care. We focus on three burdensome conditions, including (1) coronary artery disease, (2) stroke, and (3) heart failure, which, collectively, lead to the vast majority of CVD‐caused mortality and disability. For each condition, we characterize a typical patient's journey in receiving cardiovascular care, elucidating key challenges in improving care and outlining research questions for healthcare operations management scholars. We close with a reference to new research opportunities that emerge as artificial intelligence is likely to transform much of cardiovascular care. 相似文献
159.
We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares. 相似文献
160.
This paper empirically re‐examines the long‐run co‐movements and the causal relationships between GDP and defence expenditures in a multivariate model with real defence expenditure per capita (ME), real GDP per capita (GDP), and real capital stock per capita (K). We apply the view of the aggregate production function to construct the empirical model. Using up‐to‐date data for 27 OECD countries and 62 non‐OECD countries for the 1988–2003 period, we combine cross‐sectional and time series data to re‐investigate the relationship between GDP and ME. Previous studies using time series data may have yielded misleading results on account of the short time span of typical datasets. By contrast, we use recently developed panel unit root tests and heterogeneous panel cointegration tests, and conclude that there is fairly strong evidence in favour of the hypothesis of a long‐run equilibrium relationship between GDP and ME. The long‐run panel regression parameter results, such as the fully modified OLS, indicate that a positive relationship between GDP and ME only holds for OECD countries, whereas a negative relationship from ME to GDP only exists in non‐OECD countries under examination and in the panel as a whole. Furthermore, by implementing the dynamic panel‐based error correction model, we determine that GDP and ME lack short‐run causalities, but do show long‐run bidirectional causalities in both OECD and non‐OECD countries. 相似文献