全文获取类型
| 收费全文 | 718篇 |
| 免费 | 7篇 |
| 国内免费 | 13篇 |
专业分类
| 738篇 |
出版年
| 2025年 | 2篇 |
| 2024年 | 1篇 |
| 2023年 | 8篇 |
| 2022年 | 2篇 |
| 2021年 | 6篇 |
| 2020年 | 8篇 |
| 2019年 | 18篇 |
| 2018年 | 8篇 |
| 2017年 | 35篇 |
| 2016年 | 36篇 |
| 2015年 | 30篇 |
| 2014年 | 34篇 |
| 2013年 | 81篇 |
| 2012年 | 38篇 |
| 2011年 | 37篇 |
| 2010年 | 30篇 |
| 2009年 | 47篇 |
| 2008年 | 40篇 |
| 2007年 | 48篇 |
| 2006年 | 51篇 |
| 2005年 | 40篇 |
| 2004年 | 36篇 |
| 2003年 | 22篇 |
| 2002年 | 18篇 |
| 2001年 | 18篇 |
| 2000年 | 14篇 |
| 1999年 | 6篇 |
| 1998年 | 4篇 |
| 1997年 | 3篇 |
| 1996年 | 2篇 |
| 1995年 | 1篇 |
| 1994年 | 2篇 |
| 1993年 | 3篇 |
| 1991年 | 1篇 |
| 1990年 | 4篇 |
| 1989年 | 3篇 |
| 1988年 | 1篇 |
排序方式： 共有738条查询结果，搜索用时 15 毫秒
111.
Vendor‐managed revenue‐sharing arrangements are common in the newspaper and other industries. Under such arrangements, the supplier decides on the level of inventory while the retailer effectively operates under consignment, sharing the sales revenue with his supplier. We consider the case where the supplier is unable to predict demand, and must base her decisions on the retailer‐supplied probabilistic forecast for demand. We show that the retailer's best choice of a distribution to report to his supplier will not be the true demand distribution, but instead will be a degenerate distribution that surprisingly induces the supplier to provide the system‐optimal inventory quantity. (To maintain credibility, the retailer's reports of daily sales must then be consistent with his supplied forecast.) This result is robust under nonlinear production costs and nonlinear revenue‐sharing. However, if the retailer does not know the supplier's production cost, the forecast “improves” and could even be truthful. That, however, causes the supplier's order quantity to be suboptimal for the overall system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
112.
We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
113.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
114.
This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
115.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
116.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
117.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
118.
网络中心作战体系效能评估方法初探 总被引：2，自引：0，他引：2
网络中心作战体系是信息化战争要求下的一个具体作战体系,其效能评估是网络中心战研究领域的重要问题,是解决网络中心作战体系建设中方案论证、性能效能指标、经济因素等诸多问题的有效方法。首先提出了网络中心作战体系效能评估的基本概念;然后阐述了网络中心作战体系效能评估方法问题,分析介绍了几种较为成熟的评估方法的特点、适用性和不足;最后提出一种基于探索性建模与分析方法的网络中心作战体系效能评估框架,作为研究网络中心作战体系效能评估的参考评估框架。 相似文献
119.
While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
120.
We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献