全文获取类型
收费全文 | 414篇 |
免费 | 111篇 |
国内免费 | 12篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 6篇 |
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 22篇 |
2016年 | 28篇 |
2015年 | 24篇 |
2014年 | 23篇 |
2013年 | 74篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 29篇 |
2009年 | 30篇 |
2008年 | 30篇 |
2007年 | 36篇 |
2006年 | 24篇 |
2005年 | 21篇 |
2004年 | 25篇 |
2003年 | 13篇 |
2002年 | 17篇 |
2001年 | 12篇 |
2000年 | 12篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1992年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有537条查询结果,搜索用时 31 毫秒
231.
This paper considers a discrete time, single item production/inventory system with random period demands. Inventory levels are reviewed periodically and managed using a base‐stock policy. Replenishment orders are placed with the production system which is capacitated in the sense that there is a single server that sequentially processes the items one at a time with stochastic unit processing times. In this setting the variability in demand determines the arrival pattern of production orders at the queue, influencing supply lead times. In addition, the inventory behavior is impacted by the correlation between demand and lead times: a large demand size corresponds to a long lead time, depleting the inventory longer. The contribution of this paper is threefold. First, we present an exact procedure based on matrix‐analytic techniques for computing the replenishment lead time distribution given an arbitrary discrete demand distribution. Second, we numerically characterize the distribution of inventory levels, and various other performance measures such as fill rate, base‐stock levels and optimal safety stocks, taking the correlation between demand and lead times into account. Third, we develop an algorithm to fit the first two moments of the demand and service time distribution to a discrete phase‐type distribution with a minimal number of phases. This provides a practical tool to analyze the effect of demand variability, as measured by its coefficient of variation, on system performance. We also show that our model is more appropriate than some existing models of capacitated systems in discrete time. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
232.
In this article, we consider a multi‐product closed‐loop supply chain network design problem where we locate collection centers and remanufacturing facilities while coordinating the forward and reverse flows in the network so as to minimize the processing, transportation, and fixed location costs. The problem of interest is motivated by the practice of an original equipment manufacturer in the automotive industry that provides service parts for vehicle maintenance and repair. We provide an effective problem formulation that is amenable to efficient Benders reformulation and an exact solution approach. More specifically, we develop an efficient dual solution approach to generate strong Benders cuts, and, in addition to the classical single Benders cut approach, we propose three different approaches for adding multiple Benders cuts. These cuts are obtained via dual problem disaggregation based either on the forward and reverse flows, or the products, or both. We present computational results which illustrate the superior performance of the proposed solution methodology with multiple Benders cuts in comparison to the branch‐and‐cut approach as well as the traditional Benders decomposition approach with a single cut. In particular, we observe that the use of multiple Benders cuts generates stronger lower bounds and promotes faster convergence to optimality. We also observe that if the model parameters are such that the different costs are not balanced, but, rather, are biased towards one of the major cost categories (processing, transportation or fixed location costs), the time required to obtain the optimal solution decreases considerably when using the proposed solution methodology as well as the branch‐and‐cut approach. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
233.
There has been much research on the general failure model recently. In the general failure model, when the unit fails at its age t, Type I failure (minor failure) occurs with probability 1 ? p(t) and Type II failure (catastrophic failure) occurs with probability p(t). In the previous research, some specific shapes (constant, non‐decreasing, or bathtub‐shape) on the probability function p(t) are assumed. In this article, general results on some probability functions are obtained and applied to study the shapes of p(t). The results are also applied to determining the optimal inspection and allocation policies in maintenance problems. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
234.
E‐commerce platforms afford retailers unprecedented visibility into customer purchase behavior and provide an environment in which prices can be updated quickly and cheaply in response to changing market conditions. This study investigates dynamic pricing strategies for maximizing revenue in an Internet retail channel by actively learning customers' demand response to price. A general methodology is proposed for dynamically pricing information goods, as well as other nonperishable products for which inventory levels are not an essential consideration in pricing. A Bayesian model of demand uncertainty involving the Dirichlet distribution or a mixture of such distributions as a prior captures a wide range of beliefs about customer demand. We provide both analytic formulas and efficient approximation methods for updating these prior distributions after sales data have been observed. We then investigate several strategies for sequential pricing based on index functions that consider both the potential revenue and the information value of selecting prices. These strategies require a manageable amount of computation, are robust to many types of prior misspecification, and yield high revenues compared to static pricing and passive learning approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
235.
Ben A. Chaouch 《海军后勤学研究》2007,54(1):94-108
This paper develops an inventory model that determines replenishment strategies for buyers facing situations in which sellers offer price‐discounting campaigns at random times as a way to drive sales or clear excess inventory. Specifically, the model deals with the inventory of a single item that is maintained to meet a constant demand over time. The item can be purchased at two different prices denoted high and low. We assume that the low price goes into effect at random points in time following an exponential distribution and lasts for a random length of time following another exponential distribution. We highlight a replenishment strategy that will lead to the lowest inventory holding and ordering costs possible. This strategy is to replenish inventory only when current levels are below a certain threshold when the low price is offered and the replenishment is to a higher order‐up‐to level than the one currently in use when inventory depletes to zero and the price is high. Our analysis provides new insight into the behavior of the optimal replenishment strategy in response to changes in the ratio of purchase prices together with changes in the ratio of the duration of a low‐price period to that of a high‐price period. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
236.
William H. Ruckle 《海军后勤学研究》2007,54(5):492-496
In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
237.
Consider a repeated newsvendor problem for managing the inventory of perishable products. When the parameter of the demand distribution is unknown, it has been shown that the traditional separated estimation and optimization (SEO) approach could lead to suboptimality. To address this issue, an integrated approach called operational statistics (OS) was developed by Chu et al., Oper Res Lett 36 (2008) 110–116. In this note, we first study the properties of this approach and compare its performance with that of the traditional SEO approach. It is shown that OS is consistent and superior to SEO. The benefit of using OS is larger when the demand variability is higher. We then generalize OS to the risk‐averse case under the conditional value‐at‐risk (CVaR) criterion. To model risk from both demand sampling and future demand uncertainty, we introduce a new criterion, called the total CVaR, and find the optimal OS under this new criterion. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 206–214, 2015 相似文献
238.
We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015 相似文献
239.
In this article, we seek to understand how a capacity‐constrained seller optimally prices and schedules product shipping to customers who are heterogeneous on willingness to pay (WTP) and willingness to wait (WTW). The capacity‐constrained seller does not observe each customer's WTP and WTW and knows only the aggregate distributions of WTP and WTW. The seller's problem is modeled as an M/M/Ns queueing model with multiclass customers and multidimensional information screening. We contribute to the literature by providing an optimal and efficient algorithm. Furthermore, we numerically find that customers with a larger waiting cost enjoys a higher scheduling priority, but customers with higher valuation do not necessarily get a higher scheduling priority. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 215–227, 2015 相似文献
240.
针对不返回起始点、多个待救援点的应急救援路径规划问题,提出了一种应急救援路径规划的改进蚁群算法,设计了一种新的路径构造方法,为蚁群算法求解该类问题打下了基础。为提高收敛性,改进了信息素更新规则,构造了一种与蚁群算法有效结合的局部搜索算法,提高了算法快速寻优的能力。仿真结果表明:改进蚁群算法能够快速找到一条从救援中心到多个待救援点的优化路径,且收敛速度和最短路径较同类算法更优。 相似文献