全文获取类型
| 收费全文 | 2713篇 |
| 免费 | 52篇 |
| 国内免费 | 22篇 |
专业分类
| 2787篇 |
出版年
| 2025年 | 13篇 |
| 2024年 | 16篇 |
| 2023年 | 48篇 |
| 2022年 | 26篇 |
| 2021年 | 36篇 |
| 2020年 | 67篇 |
| 2019年 | 52篇 |
| 2018年 | 61篇 |
| 2017年 | 119篇 |
| 2016年 | 98篇 |
| 2015年 | 80篇 |
| 2014年 | 175篇 |
| 2013年 | 186篇 |
| 2012年 | 154篇 |
| 2011年 | 196篇 |
| 2010年 | 145篇 |
| 2009年 | 185篇 |
| 2008年 | 136篇 |
| 2007年 | 142篇 |
| 2006年 | 138篇 |
| 2005年 | 128篇 |
| 2004年 | 120篇 |
| 2003年 | 81篇 |
| 2002年 | 74篇 |
| 2001年 | 69篇 |
| 2000年 | 43篇 |
| 1999年 | 35篇 |
| 1998年 | 34篇 |
| 1997年 | 23篇 |
| 1996年 | 24篇 |
| 1995年 | 19篇 |
| 1994年 | 17篇 |
| 1993年 | 8篇 |
| 1992年 | 13篇 |
| 1991年 | 10篇 |
| 1990年 | 6篇 |
| 1989年 | 6篇 |
| 1988年 | 2篇 |
| 1987年 | 1篇 |
| 1975年 | 1篇 |
排序方式： 共有2787条查询结果，搜索用时 15 毫秒
391.
为探索信息化作战中指挥控制关键因素,提出改进作战指挥体制的对策措施,采用系统动力学理论,对协同决策的结构、参与者和信息反馈关系等关键因素进行了分析,在此基础上构建了基于系统动力学的协同决策模型并进行了模拟仿真。结果表明,增加指挥控制机构之间的信息共享可以有效提升协同决策的效率,为建立协同决策指挥控制体制提供了借鉴意义。 相似文献
392.
In this article, we present an algorithm for the valuation and optimal operation of natural gas storage facilities. Real options theory is used to derive nonlinear partial‐integro‐differential equations (PIDEs), the solution of which give both valuation and optimal operating strategies for these facilities. The equations are designed to incorporate a wide class of spot price models that can exhibit the same time‐dependent, mean‐reverting dynamics, and price spikes as those observed in most energy markets. Particular attention is paid to the operational characteristics of real storage units. These characteristics include working gas capacities, variable deliverability and injection rates, and cycling limitations. We illustrate the model with a numerical example of a salt cavern storage facility that clearly shows how a gas storage facility is like a financial straddle with both put and call properties. Depending on the amount of gas in storage the relative influence of the put and call components vary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
393.
Extended warranties provide “piece of mind” to a consumer in that product failures which occur after the base warranty expires are rectified at little or no cost. They also provide an additional source of revenue for manufacturers or third‐party providers, such as retailers or insurance providers, and help cultivate consumer loyalty. In this article, we analyze a number of extended warranty contracts which differ in design, including restrictions on deferrals and renewals. With the use of dynamic programming, we compute the optimal strategy for a consumer with perfect information and determine the optimal pricing policy for the provider given the consumer's risk characterization. We also provide insight into when different contracts should be issued. Finally, we illustrate how profits can be dramatically increased by offering menus of warranty contracts, as opposed to stand alone contracts, with the use of integer programming. Surprisingly, risk‐taking consumers provide the greatest benefit to offering menus. These insights can help a company develop a comprehensive warranty planning strategy for given products or product lines. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
394.
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 相似文献
395.
Xiangtong Qi 《海军后勤学研究》2005,52(4):312-320
Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
396.
对作战指挥系统软件的功能模块进行分析,引入软件构件开发的思想,采用COM/DCOM构件技术,在现有软件系统中增加远程管理构件,通过客户端程序对远程服务器管理构件的访问,动态管理远程机器上运行的作战指挥系统软件功能模块,使得作战指挥系统软件的各个功能模块能够稳定运行,使分布式作战指挥系统软件具有动态定义、动态重组、动态管理等功能,大大提高了作战指挥系统软件的可靠性和可交互性,使作战指挥系统软件达到了互连、互通、互操作性的目的. 相似文献
397.
航迹关联算法在飞行计划管理中的应用 总被引：1，自引：0，他引：1
针对传统飞行计划管理中的缺限,基于MK－NN航迹关联算法思想,提出了一种利用方向因子、速度因子、偏航因子、时差因子和区域因子对综合航迹和计划航迹进行比较关联的方法,实现对飞行计划实施的动态监控,从而提高了飞行计划管理的准确性与科学性。 相似文献
398.
399.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
400.
We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献