全文获取类型
收费全文 | 148篇 |
免费 | 60篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 22篇 |
2013年 | 13篇 |
2012年 | 15篇 |
2011年 | 13篇 |
2010年 | 7篇 |
2009年 | 14篇 |
2008年 | 10篇 |
2007年 | 14篇 |
2006年 | 9篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有219条查询结果,搜索用时 15 毫秒
171.
172.
由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。 相似文献
173.
引入价格因素,针对网络资源分配提出PE-EMRA网络资源分配模型,并给出算法实现。PE-EMRA模型综合考虑带宽、缓冲等多种网络资源,调节并限制各业务类流量,使系统总效率最大化。该方法可有效提高资源利用率,提供服务质量保证,并具有配置灵活、实现代价小等特点。 相似文献
174.
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. 相似文献
175.
176.
177.
“Evergreening” is a strategy wherein an innovative pharmaceutical firm introduces an upgrade of its current product when the patent on this product expires. The upgrade is introduced with a new patent and is designed to counter competition from generic manufacturers that seek to imitate the firm's existing product. However, this process is fraught with uncertainty because the upgrade is subject to stringent guidelines and faces approval risk. Thus, an incumbent firm has to make an upfront production capacity investment without clarity on whether the upgrade will reach the market. This uncertainty may also affect the capacity investment of a competing manufacturer who introduces a generic version of the incumbent's existing product but whose market demand depends on the success or failure of the upgrade. We analyze a game where capacity investment occurs before uncertainty resolution and firms compete on prices thereafter. Capacity considerations that arise due to demand uncertainty introduce new factors into the evergreening decision. Equilibrium analysis reveals that the upgrade's estimated approval probability needs to exceed a threshold for the incumbent to invest in evergreening. This threshold for evergreening increases as the intensity of competition in the generic market increases. If evergreening is optimal, the incumbent's capacity investment is either decreasing or nonmonotonic with respect to low end market competition depending on whether the level of product improvement in the upgrade is low or high. If the entrant faces a capacity constraint, then the probability threshold for evergreening is higher than the case where the entrant is not capacity constrained. Finally, by incorporating the risk‐return trade‐off that the incumbent faces in terms of the level of product improvement versus the upgrade success probability, we can characterize policy for a regulator. We show that the introduction of capacity considerations may maximize market coverage and/or social surplus at incremental levels of product improvement in the upgrade. This is contrary to the prevalent view of regulators who seek to curtail evergreening involving incremental product improvement. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 71–89, 2016 相似文献
178.
179.
180.