首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   539篇
  免费   193篇
  国内免费   11篇
  2023年   3篇
  2022年   9篇
  2021年   29篇
  2020年   6篇
  2019年   7篇
  2018年   6篇
  2017年   5篇
  2016年   6篇
  2015年   22篇
  2014年   17篇
  2013年   31篇
  2012年   19篇
  2011年   15篇
  2010年   22篇
  2009年   29篇
  2008年   20篇
  2007年   37篇
  2006年   15篇
  2005年   30篇
  2004年   7篇
  2003年   4篇
  2002年   4篇
  2001年   9篇
  2000年   22篇
  1999年   47篇
  1998年   50篇
  1997年   39篇
  1996年   40篇
  1995年   30篇
  1994年   33篇
  1993年   26篇
  1992年   18篇
  1991年   24篇
  1990年   21篇
  1989年   11篇
  1988年   5篇
  1987年   7篇
  1986年   8篇
  1985年   5篇
  1983年   2篇
  1982年   2篇
  1977年   1篇
排序方式: 共有743条查询结果,搜索用时 15 毫秒
431.
首尾相接的循环队列是一种动态的数据结构。本文给出了在并发进程环境下,使用循环队列的判定定理,本定理已在银河机软件实现中得到应用。  相似文献   
432.
Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ jm, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000  相似文献   
433.
环境信息动态更新是分布式虚拟环境的一个主要特点,如何使环境信息更新更活跃、更反应实际情况,一直是分布式虚拟环境研究的重点。在典型的分布式交互环境中,环境信息动态更新是基于协议数据单元(PDU),它不提供数据可靠性传输保证。如何保证分布式环境中各结点环境信息一致性,本文提出了一种信息校验和协议,它通过极少的信息传输就可保证各结点环境信息高度一致。文中定义了保证分布式环境信息动态一致性更新的协议数据单元,并在试验环境中证明了协议的可靠性。  相似文献   
434.
An important phenomenon often observed in supply chain management, known as the bullwhip effect, implies that demand variability increases as one moves up the supply chain, i.e., as one moves away from customer demand. In this paper we quantify this effect for simple, two‐stage, supply chains consisting of a single retailer and a single manufacturer. We demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the use of a moving average forecast. We consider two types of demand processes, a correlated demand process and a demand process with a linear trend. We then discuss several important managerial insights that can be drawn from this research. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 269–286, 2000  相似文献   
435.
本文通过介绍《重庆市办理失火罪和消防责任事故罪案件立案标准(暂行)》,简述了失火罪与消防责任事故罪的具体概念、主要构成特征及区别。  相似文献   
436.
In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.  相似文献   
437.
A critical issue for many governments is boosting the adoption rates of products or technologies that enhance consumer surplus or total social welfare. Governments may, for example, pay subsidies to producers or to consumers to stimulate the manufacture or consumption of specific products, for example, energy-efficient appliances or more effective drugs. This research proposes a strategic government investment policy, namely, share acquisition, and demonstrates its effectiveness in reaching societal objectives. We consider a Cournot quantities-choice market comprised of homogeneous firms where the government intervenes to buy shares, and turning private firms into state-owned enterprises. We recognize that purchasing a single private firm is the optimal policy for the government to reach its societal objectives. Additionally, taking into consideration financial constraints, we find that the optimal stake increases with the budget. Compared with the optimal output-based subsidy policy, when the budget is low, the optimal government investment policy induces a higher consumer surplus. In addition, in differentiated Cournot competition, under which firms compete in selling substitutable products, we find that when the budget is sufficient, the optimal stake purchased first decreases and then increases according to the substitutability level among products.  相似文献   
438.
We incorporate strategic customer waiting behavior in the classical economic order quantity (EOQ) setting. The seller determines not only the timing and quantities of the inventory replenishment, but also the selling prices over time. While similar ideas of market segmentation and intertemporal price discrimination can be carried over from the travel industries to other industries, inventory replenishment considerations common to retail outlets and supermarkets introduce additional features to the optimal pricing scheme. Specifically, our study provides concrete managerial recommendations that are against the conventional wisdom on “everyday low price” (EDLP) versus “high-low pricing” (Hi-Lo). We show that in the presence of inventory costs and strategic customers, Hi-Lo instead of EDLP is optimal when customers have homogeneous valuations. This result suggests that because of strategic customer behavior, the seller obtains a new source of flexibility—the ability to induce customers to wait—which always leads to a strictly positive increase of the seller's profit. Moreover, the optimal inventory policy may feature a dry period with zero inventory, but this period does not necessarily result in a loss of sales as customers strategically wait for the upcoming promotion. Furthermore, we derive the solution approach for the optimal policy under heterogeneous customer valuation setting. Under the optimal policy, the replenishments and price promotions are synchronized, and the seller adopts high selling prices when the inventory level is low and plans a discontinuous price discount at the replenishment point when inventory is the highest.  相似文献   
439.
We study the assortment optimization problem with position effects under the nested logit model, whose goal is to find the revenue-maximizing subset of products as well as their corresponding display positions. In this joint assortment-position optimization problem, the choices of products are affected by not only their qualities and prices but also the positions where they are displayed. Despite determining the assortment and their corresponding display positions sequentially, we propose to solve this problem in an integrated way to obtain the optimal solution. We formulate this problem as a nonlinear binary integer programming model and develop a dynamic programming based solution approach to obtain the optimal assortment-position assignments. We carry out extensive numerical experiments to evaluate the benefit of our integrated approach. The most important insight we discover is that it is not necessarily better to put the most attractive products in the best position. Moreover, we show that compared to the sequential approaches, our approach can improve revenue by 10.38% on average, which suggests that firms should take into consideration position effects when making assortment decisions. Finally, we discuss results related to two extensions of this problem, that is, the special case when positions are preassigned to nests, and the joint assortment-position-price optimization problem.  相似文献   
440.
针对动态环境下的传感器-武器联合任务管理问题展开研究。根据在动态作战过程中出现的有效新目标、有效空闲传感器和武器数量设定阶段门限,以决定进入下一阶段的时机,从而构建多阶段的作战过程。从打击方案质量及系统响应时间的角度出发,分析构建分布式作战体系对系统作战效能的影响,使系统在每个任务管理阶段可以决定响应流程。通过仿真实验验证了所构建的分布式作战体系与设定的阶段门限可以明显提升系统的作战效能。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号