排序方式: 共有192条查询结果,搜索用时 171 毫秒
161.
162.
A fundamental difficulty in developing effective production planning models has been accurately reflecting the nonlinear dependency between workload and lead times. We develop a mathematical programming model for production planning in multiproduct, single stage systems that captures the nonlinear dependency between workload and lead times. We then use outer linearization of this nonlinear model to obtain a linear programming formulation and extend it to multistage systems. Extensive computational experiments validate the approach and compare its results to conventional models that assume workload‐independent planning lead times. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
163.
A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
164.
基于近极轨微纳卫星星座在高速数据传输模型下的网络特点,给出近极轨微纳卫星星座的高速数据传输的模型,分析适用于该模型的路由算法,推导该路由算法开销的计算方式,说明了算法在高速数传模型下的不足;给出算法的改进策略;利用NS3网络仿真平台建立微纳卫星星座高速数传网络场景,仿真了该场景下采用改进路由算法前后的关键性能指标。研究结果表明:在近极轨微纳卫星星座构建的高速数据传输网络中,改进算法在使得吞吐率和分组到达率有所提升的同时,显著降低了网络系统路由开销,微纳卫星高速数据传输网络的性能得到优化。 相似文献
165.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
166.
167.
战术MANET的QoS路由计算是一个NP完全问题,可以采用蚁群优化算法来求解.为了提高蚁群优化QoS路由算法的效率,降低时延和网络开销,提出了基于多态转移策略的蚁群优化QoS路由算法(MTS-AQRA).MTS-AQRA将链路稳定性和路由拥塞度与常规的QoS路由约束条件结合起来,利用多态转移策略产生的多样化路由搜索蚁群和并行路由搜索处理,能够在MANET网络中快速地建立满足业务QoS要求的稳定路由.仿真实验结果表明,MTS-AQRA在分组到达率、端到端时延、网络吞吐量等指标上综合性能优于AODV、AntHocNet、QoS-Aware ACO等路由算法. 相似文献
168.
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001 相似文献
169.
The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999 相似文献
170.
针对现有的软件定义卫星网络中流表占用的三态内容寻址存储器空间不断增加,复杂的流表项查找、匹配过程导致路由转发效率降低,无法满足多样化应用需求的问题,提出基于神经网络的软件定义卫星网络智能路由架构。控制器通过训练神经网络获取数据流的传输模式,并用训练后的神经网络代替流表,在此基础上提出基于Chebyshev神经网络的智能路由策略,交换机根据数据流的业务类型预测其转发路径,以满足卫星网络应用的服务质量要求。仿真结果表明:所提路由策略显著减少了占用的三态内容寻址存储器存储空间,提高了路由效率。 相似文献