全文获取类型
收费全文 | 1502篇 |
免费 | 393篇 |
国内免费 | 133篇 |
出版年
2024年 | 4篇 |
2023年 | 7篇 |
2022年 | 24篇 |
2021年 | 29篇 |
2020年 | 25篇 |
2019年 | 24篇 |
2018年 | 26篇 |
2017年 | 70篇 |
2016年 | 92篇 |
2015年 | 66篇 |
2014年 | 97篇 |
2013年 | 148篇 |
2012年 | 104篇 |
2011年 | 118篇 |
2010年 | 118篇 |
2009年 | 128篇 |
2008年 | 100篇 |
2007年 | 116篇 |
2006年 | 124篇 |
2005年 | 102篇 |
2004年 | 95篇 |
2003年 | 59篇 |
2002年 | 50篇 |
2001年 | 42篇 |
2000年 | 53篇 |
1999年 | 30篇 |
1998年 | 24篇 |
1997年 | 26篇 |
1996年 | 25篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 19篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 6篇 |
1988年 | 3篇 |
排序方式: 共有2028条查询结果,搜索用时 15 毫秒
861.
编辑职业倦怠归因分析 总被引:1,自引:0,他引:1
马黎 《中国人民武装警察部队学院学报》2007,23(3):91-93
编辑职业倦怠是目前形势下出现的一种心理现象。主要表现为焦虑和疲惫心理严重,工作缺乏激情;与人沟通困难,人际关系紧张;工作进取心不足,事业成就感低等。应从工作和职业特征因素、组织管理因素、个体因素三方面提出缓解编辑职业倦怠现象的对策。 相似文献
862.
分析了地铁在火灾情况下区间隧道和站台各种通风系统运行模式,以及通风系统有效运行所需达到的物理参数。对通风模式进行了分析,确定了火灾情况下最佳的通风方式。分析现行规范规定的数据,用临界风速公式进行计算得出区间隧道风速不满足通风要求。 相似文献
863.
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 相似文献
864.
Antoon W.J. Kolen Jan Karel Lenstra Christos H. Papadimitriou Frits C.R. Spieksma 《海军后勤学研究》2007,54(5):530-543
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
865.
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 相似文献
866.
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 相似文献
867.
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 相似文献
868.
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. 相似文献
869.
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 相似文献
870.
线性规划优化分析在经济管理等领域有着广泛的应用。当线性规划约束条件的右端向量在一定范围内变化时,目标函数的最优值是右端向量的一个复杂的分片线性函数,但通常难以给出分析表达式。应用多项式回归、径向基函数、Kriging法及多项式回归 Kriging法这四种元模型方法,能快速预测最优值函数。通过仿真实验,对这四种形式的元模型作较全面的比较分析。数值实验的结果表明,用次数较少的实验设计,后三种方法都具有较高的拟合精度;特别地,多项式回归 Kriging法不仅拟合精度高,而且还能用一个二阶多项式给出最优值函数的一个简明的近似描述。结果表明,元模型方法是研究线性规划优化分析问题的有效途径。 相似文献