全文获取类型
收费全文 | 553篇 |
免费 | 165篇 |
国内免费 | 77篇 |
出版年
2024年 | 3篇 |
2023年 | 8篇 |
2022年 | 9篇 |
2021年 | 8篇 |
2020年 | 18篇 |
2019年 | 16篇 |
2018年 | 12篇 |
2017年 | 34篇 |
2016年 | 45篇 |
2015年 | 33篇 |
2014年 | 52篇 |
2013年 | 72篇 |
2012年 | 51篇 |
2011年 | 47篇 |
2010年 | 29篇 |
2009年 | 40篇 |
2008年 | 33篇 |
2007年 | 45篇 |
2006年 | 30篇 |
2005年 | 30篇 |
2004年 | 36篇 |
2003年 | 28篇 |
2002年 | 13篇 |
2001年 | 23篇 |
2000年 | 21篇 |
1999年 | 12篇 |
1998年 | 14篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1989年 | 1篇 |
排序方式: 共有795条查询结果,搜索用时 15 毫秒
751.
752.
A major challenge in making supply meet demand is to coordinate transshipments across the supply chain to reduce costs and increase service levels in the face of demand fluctuations, short lead times, warehouse limitations, and transportation and inventory costs. In particular, transshipment through crossdocks, where just‐in‐time objectives prevail, requires precise scheduling between suppliers, crossdocks, and customers. In this work, we study the transshipment problem with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities. Transportation is provided by fixed or flexible schedules and lot‐sizing is dealt with through multiple shipments. We develop polynomial‐time algorithms or, otherwise, provide the complexity of the problems studied. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
753.
We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
754.
We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
755.
仿真引擎作为仿真系统的核心,是HLA仿真联邦中的特殊联邦成员。论述了基于实体、成员和引擎的层次式仿真调度概念结构,及其采用的基于时间序和事件序的仿真调度方案,将作战实体的时间推进和交战处理都归入仿真引擎,确保了全局时间统一性、实体同步性和交战事件的有序性,而且各种参量的设置灵活,便于控制。介绍了仿真引擎成员的设计与实现。该引擎成员在某指挥自动化作战效能仿真与评估系统中得以应用。 相似文献
756.
随着网络带宽的不断提高,分组到达路由器的时间间隔不断缩短,对路由器处理分组的速度提出了新的要求。传统的分组调度算法,如WFQ,由于性能和可扩展性等问题,难以在高性能核心路由器中实现。为此,提出了分组非精确调度技术,在不影响应用QoS的前提下对经典的调度算法进行修改,通过简化硬件设计提高调度器的服务能力。模拟分析表明,采用非精确调度技术的SLQF算法的延时特性与传统算法LQF基本一致。 相似文献
757.
舰船燃气轮机双机并车控制仿真技术研究 总被引:5,自引:1,他引:4
介绍了功率反馈控制技术的原理和特点,并利用功率反馈控制技术对舰船燃气轮机双机并车控制技术进行了分析.利用C++语言建立了全燃动力装置的仿真模型,并对功率反馈法进行了计算机仿真试验.结果表明,功率反馈控制技术能较好地实现舰船燃气轮机双机并车运行的控制. 相似文献
758.
闪电监测载荷搭载在不同卫星平台时,地面站对它的观测时间都会发生相应的改变,文中对其进行了计算,并对不同轨道高度下所需的地面站个数作了简要分析。 相似文献
759.
对飞越北极,缩短航线,节省航行时间问题进行了研究。采用了多种算法,对其有效性、适用性和复杂性进行分析讨论。假设"在旋转椭球体中,以通过球心和该椭球体上任意两点所构成的平面截此椭球体所得轨迹弧长作为曲面上两点间最短距离的近似值",在此基础上,通过运用数学软件计算得出结论:从北京出发,飞越北极抵达底特律的飞行时间可节省4.079 6h,从而使问题得到了进一步的验证。 相似文献
760.
Integrated scheduling of loading and transportation with tractors and semitrailers separated
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015 相似文献