全文获取类型
| 收费全文 | 1112篇 |
| 免费 | 0篇 |
专业分类
| 1112篇 |
出版年
| 2024年 | 5篇 |
| 2022年 | 6篇 |
| 2021年 | 46篇 |
| 2020年 | 7篇 |
| 2019年 | 4篇 |
| 2018年 | 2篇 |
| 2017年 | 7篇 |
| 2016年 | 6篇 |
| 2015年 | 27篇 |
| 2014年 | 33篇 |
| 2013年 | 29篇 |
| 2012年 | 22篇 |
| 2011年 | 13篇 |
| 2010年 | 47篇 |
| 2009年 | 63篇 |
| 2008年 | 39篇 |
| 2007年 | 57篇 |
| 2006年 | 26篇 |
| 2005年 | 29篇 |
| 2004年 | 3篇 |
| 2002年 | 2篇 |
| 2001年 | 3篇 |
| 2000年 | 20篇 |
| 1999年 | 110篇 |
| 1998年 | 85篇 |
| 1997年 | 67篇 |
| 1996年 | 52篇 |
| 1995年 | 48篇 |
| 1994年 | 44篇 |
| 1993年 | 36篇 |
| 1992年 | 37篇 |
| 1991年 | 37篇 |
| 1990年 | 45篇 |
| 1989年 | 9篇 |
| 1988年 | 4篇 |
| 1987年 | 12篇 |
| 1986年 | 6篇 |
| 1985年 | 9篇 |
| 1983年 | 11篇 |
| 1982年 | 3篇 |
| 1978年 | 1篇 |
排序方式： 共有1112条查询结果，搜索用时 15 毫秒
911.
Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products. 相似文献
912.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
913.
Inventory transshipment is generally shown to be beneficial to retailers by matching their excess demand with surplus inventory. We investigate an inventory transshipment game with two newsvendor-type retailers under limited total supply and check whether the retailers are better off than the case without transshipment. We derive the ordering strategies for the retailers and show that unlike the unlimited supply case, a pure Nash equilibrium only exists under certain conditions. Furthermore, contrary to the conventional wisdom, we show that inventory transshipment may not always benefit both retailers. Although one of the retailers is guaranteed to be better off, the other could be worse off. The decision criteria are then provided for the retailers to determine if they will benefit from the exercise of inventory transshipment. Numerical study indicates that the carefully chosen transshipment prices play an important role in keeping inventory transshipment beneficial to both retailers. Subsequently, a coordinating mechanism is designed for the retailers to negotiate transshipment prices that maximize the total profit of the two retailers while keeping each of them in a beneficial position. 相似文献
914.
碳纤维混凝土受压应力-应变全曲线研究是对其基本力学性能进行全面认识的基础,也是表现碳纤维混凝土基本受压特性的综合宏观反映。对9组（碳纤维体积分数分别为0,0.2%,0.4%,0.6%,0.8%,1.0%,1.2%,1.4%,1.6%）碳纤维混凝土试件进行了立方体和棱柱体抗压强度试验,结果表明碳纤维混凝土立方体和棱柱体抗压强度随碳纤维体积分数的增加呈下降趋势,峰值应变随碳纤维体积分数的增加呈增大趋势。基于各体积分数碳纤维混凝土的棱柱体抗压强度和峰值应变的试验数据,拟合得到了棱柱体抗压强度和峰值应变与体积分数之间的函数表达式。利用微机控制电液伺服压力试验机测定了9组碳纤维混凝土应力-应变全曲线,参照非线弹性理论的混凝土单轴受压应力-应变本构模型,根据测得的全曲线应力-应变数据,拟合得到了应力-应变全曲线上升段表达式参数和下降段表达式参数,最后给出了基于碳纤维体积分数变化的碳纤维混凝土单轴受压应力-应变本构方程。 相似文献
915.
This article investigates joining strategies and admission control policy for secondary users (SUs) with retrial behavior in a cognitive radio (CR) system where a single primary user (PU) coexists with multiple SUs. Under a certain reward‐cost structure, SUs opportunistically access the PU band when it is not occupied by the PU. If the band is available upon arrival, an SU decides with a probability either to use the band immediately or to balk the system. If the band is occupied, the SU must decide whether to enter the system as a retrial customer or to leave the system. Once the PU requests for service, the service of SU being served, if any, will be interrupted, and the interrupted SU leaves the band and retries for service after a random amount of time. In this article, we study the equilibrium behavior of non‐cooperative SUs who want to maximize their benefit in a selfish, distributed manner with delay‐sensitive utility function. The socially optimal strategies of SUs are also derived. To utilize the PU band more efficiently and rationally, an admission control policy is proposed to regulate SUs who enter the system in order to eliminate the gap between the individually and socially optimal strategies. 相似文献
916.
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献
917.
Whether military spending is capable of promoting social welfare is currently a controversial issue. The aim of this paper is to investigate how military spending affects the input and output of social welfare (i.e. social welfare expenditures and social welfare index). A panel cointegration analysis and an impulse response function are conducted with multi-country panel data, over two time periods, 1998–2011 and 1993–2007. In addition, to extend a comparative analysis over different economies, BRICS (i.e. Brazil, Russia, India, China, South Africa) and G7 (i.e. the US, Japan, Germany, the UK, France, Italy, Canada) countries are selected as representatives of emerging economies and developed countries, respectively. The empirical results show that military spending enhances social welfare expenditures in developed countries, while the effect is ambiguous in emerging economies. Also, military spending is capable of promoting the social welfare index based on the FMOLS estimation. The comparative analyses indicate that unlike in the G7, the effect of the growth of military spending on the growth of social welfare expenditures is negative and shorter in the BRICS. 相似文献
918.
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
919.
阐述了随机游走粒子一烟团模式（RPPM）的基本思想,并结合野外试验验证了该模式在烟幕扩散数值模拟中的应用效果。 相似文献
920.
Although quantity discount policies have been extensively analyzed, they are not well understood when there are many different buyers. This is especially the case when buyers face price‐sensitive demand. In this paper we study a supplier's optimal quantity discount policy for a group of independent and heterogeneous retailers, when each retailer faces a demand that is a decreasing function of its retail price. The problem is analyzed as a Stackelberg game whereby the supplier acts as the leader and buyers act as followers. We show that a common quantity discount policy that is designed according to buyers' individual cost and demand structures and their rational economic behavior is able to significantly stimulate demand, improve channel efficiency, and substantially increase profits for both the supplier and buyers. Furthermore, we show that the selection of all‐units or incremental quantity discount policies has no effect on the benefits that can be obtained from quantity discounts. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献