全文获取类型
| 收费全文 | 854篇 |
| 免费 | 44篇 |
| 国内免费 | 6篇 |
专业分类
| 904篇 |
出版年
| 2025年 | 11篇 |
| 2024年 | 15篇 |
| 2023年 | 38篇 |
| 2022年 | 16篇 |
| 2021年 | 12篇 |
| 2020年 | 25篇 |
| 2019年 | 21篇 |
| 2018年 | 16篇 |
| 2017年 | 50篇 |
| 2016年 | 54篇 |
| 2015年 | 34篇 |
| 2014年 | 71篇 |
| 2013年 | 40篇 |
| 2012年 | 62篇 |
| 2011年 | 53篇 |
| 2010年 | 32篇 |
| 2009年 | 54篇 |
| 2008年 | 36篇 |
| 2007年 | 38篇 |
| 2006年 | 55篇 |
| 2005年 | 35篇 |
| 2004年 | 22篇 |
| 2003年 | 18篇 |
| 2002年 | 19篇 |
| 2001年 | 12篇 |
| 2000年 | 7篇 |
| 1999年 | 11篇 |
| 1998年 | 8篇 |
| 1997年 | 1篇 |
| 1996年 | 4篇 |
| 1995年 | 7篇 |
| 1994年 | 4篇 |
| 1993年 | 5篇 |
| 1992年 | 3篇 |
| 1991年 | 5篇 |
| 1990年 | 4篇 |
| 1989年 | 6篇 |
排序方式： 共有904条查询结果，搜索用时 15 毫秒
761.
762.
装备备件管理技术综述 总被引：2，自引：0，他引：2
备件管理水平的高低直接影响着装备保障能力的发挥和使用保障费用的维持,备件管理现已成为世界范围内的研究热点。通过对国内外有关备件管理文献的分析,总结了备件管理在备件分类方法、需求预测与确定、库存控制与优化3个方面的研究现状。分析结果表明：备件管理将向多因素综合考虑的备件分类方法,基于备件需求不确定性的预测技术以及基于计算机辅助技术、物流和供应链管理等方向发展。 相似文献
763.
针对以往求解路径规划问题中以路径最短为目标的局限性以及随机选取初始路径的缺陷,引入合适的目标函数和遗传算子,提出了一种基于遗传算法的多目标虚拟装配路径规划方法,利用大范围初始化的方式产生具有代表性的初始群体,设计了具有启发作用、适合路径规划的遗传算子,能够同时得到不同特点的多条路径,优化了装配路径. 相似文献
764.
765.
We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics. 相似文献
766.
Emerging sharing modes, like the consumer-to-consumer (C2C) sharing of Uber and the business-to-consumer (B2C) sharing of GoFun, have considerably affected the retailing markets of traditional manufacturers, who are motivated to consider product sharing when making pricing and capacity decisions, particularly electric car manufacturers with limited capacity. In this paper, we examine the equilibrium pricing for a capacity-constrained manufacturer under various sharing modes and further analyze the impact of capacity constraint on the manufacturer's sharing mode selection as well as equilibrium outcomes. We find that manufacturers with low-cost products prefer B2C sharing while those with high-cost products prefer C2C sharing except when the sharing price is moderate. However, limited capacity motivates manufacturers to enter into the B2C sharing under a relatively low sharing price, and raise the total usage level by sharing high-cost products. We also show that the equilibrium capacity allocated to the sharing market with low-cost products first increases and then decreases. Finally, we find that sharing low-cost products with a high limited capacity leads to a lower retail price under B2C sharing, which creates a win-win situation for both the manufacturer and consumers. However, sharing high-cost products with a low limited capacity creates a win-lose situation for them. 相似文献
767.
Capacity providers such as airlines often sell the same capacity to different market segments at different prices to improve their expected revenues. The absence of a secondary market, due to the nontransferability of airline tickets, gives rise to an opportunity for airlines to broker capacity between consumers with different willingness to pay. One way to broker capacity is by the introduction of callable products. The idea is similar to callable bonds where the issuer has the right, but not the obligation, to buy back the bonds at a certain price by a certain date. The idea of callable products was introduced before under the assumption that the fare-class demands are all independent. The independent assumption becomes untenable when there is significant demand recovery (respectively, demand cannibalization) when lower fares are closed (respectively, opened). In this case, consumer choice behavior should be modeled explicitly to make meaningful decisions. In this paper, we consider a general consumer choice model and develop the optimal strategy for callable products. Our numerical study illustrates how callable products are win-win-win, for the capacity provider and for both high and low fare consumers. Our studies also identify conditions for callable products to result in significant improvements in expected revenues. 相似文献
768.
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. 相似文献
769.
Spatial pricing means a retailer price discriminates its customers based on their geographic locations. In this article, we study how an online retailer should jointly allocate multiple products and facilitate spatial price discrimination to maximize profits. When deciding between a centralized product allocation ((i.e., different products are allocated to the same fulfillment center) and decentralized product allocation (ie, different products are allocated to different fulfillment centers), the retailer faces the tradeoff between shipment pooling (ie, shipping multiple products in one package), and demand localization (ie, stocking products to satisfy local demand) based on its understanding of customers' product valuations. In our basic model, we consider two widely used spatial pricing policies: free on board (FOB) pricing that charges each customer the exact amount of shipping cost, and uniform delivered (UD) pricing that provides free shipping. We propose a stylized model and find that centralized product allocation is preferred when demand localization effect is relatively low or shipment pooling benefit is relatively high under both spatial pricing policies. Moreover, centralized product allocation is more preferred under the FOB pricing which encourages the purchase of virtual bundles of multiple products. Furthermore, we respectively extend the UD and FOB pricing policies to flat rate shipping (ie, the firm charges a constant shipping fee for each purchase), and linear rate shipping (ie, the firm sets the shipping fee as a fixed proportion of firm's actual fulfillment costs). While similar observations from the basic model still hold, we find the firm can improve its profit by sharing the fulfillment cost with its customers via the flat rate or linear rate shipping fee structure. 相似文献
770.
The U.S. system for procuring and utilizing deceased‐donor organs for transplantation has been studied and written about in many articles. The purpose of this paper is to examine the interactions between the elements that comprise this system, and point out improvement opportunities that may be affected through operations research/management techniques. The authors demonstrate the need for developing data‐driven and analytic tools. In fact, data is used to generate hypotheses and support claims throughout the paper. The paper also points out the need to fully leverage data that is available to researchers, and to seek data that is currently not deposited in a centralized archive. 相似文献