首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   661篇
  免费   25篇
  国内免费   3篇
  689篇
  2025年   6篇
  2024年   4篇
  2023年   18篇
  2022年   9篇
  2021年   5篇
  2020年   21篇
  2019年   20篇
  2018年   19篇
  2017年   37篇
  2016年   40篇
  2015年   30篇
  2014年   39篇
  2013年   35篇
  2012年   41篇
  2011年   31篇
  2010年   29篇
  2009年   41篇
  2008年   25篇
  2007年   30篇
  2006年   37篇
  2005年   28篇
  2004年   25篇
  2003年   17篇
  2002年   12篇
  2001年   16篇
  2000年   14篇
  1999年   11篇
  1998年   9篇
  1997年   12篇
  1996年   5篇
  1995年   4篇
  1994年   3篇
  1993年   5篇
  1992年   4篇
  1991年   4篇
  1990年   1篇
  1989年   2篇
排序方式: 共有689条查询结果,搜索用时 15 毫秒
81.
    
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
82.
对作战指挥系统软件的功能模块进行分析,引入软件构件开发的思想,采用COM/DCOM构件技术,在现有软件系统中增加远程管理构件,通过客户端程序对远程服务器管理构件的访问,动态管理远程机器上运行的作战指挥系统软件功能模块,使得作战指挥系统软件的各个功能模块能够稳定运行,使分布式作战指挥系统软件具有动态定义、动态重组、动态管理等功能,大大提高了作战指挥系统软件的可靠性和可交互性,使作战指挥系统软件达到了互连、互通、互操作性的目的.  相似文献   
83.
航迹关联算法在飞行计划管理中的应用   总被引:1,自引:0,他引:1  
针对传统飞行计划管理中的缺限,基于MK-NN航迹关联算法思想,提出了一种利用方向因子、速度因子、偏航因子、时差因子和区域因子对综合航迹和计划航迹进行比较关联的方法,实现对飞行计划实施的动态监控,从而提高了飞行计划管理的准确性与科学性。  相似文献   
84.
    
Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
85.
Many have suggested that the true purpose behind Japan’s development of a closed nuclear-fuel cycle is to maintain the technical potential to develop nuclear weapons. However, closer examination of the development of Japan’s nuclear industry shows that, although Japan possesses advanced nuclear technologies, there has been no deliberate strategy to create a nuclear-weapon option. There is no “nuclear hedge.” To illustrate this point, this article presents a framework called “dynamic institutionalization” to explain the origins of Japan’s nuclear policies and the different sets of institutionalized pressures and constraints that have perpetuated these policies over time. Japan’s continued development of closed fuel-cycle technologies is primarily driven by domestic politics and the lack of a permanent spent-fuel management solution. On the other hand, Japan’s institutionalized nuclear forbearance is driven by the calculation that, as long as US extended deterrence remains credible, Japan’s security is best guaranteed through reliance on the US nuclear umbrella. By analytically untangling the policy of closed fuel-cycle development from the rationale for nuclear forbearance, this article provides a more nuanced view of the relationships between the domestic and international variables shaping Japan’s nuclear policies.  相似文献   
86.
    
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
87.
    
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011  相似文献   
88.
    
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
89.
    
In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008  相似文献   
90.
    
We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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