基于操作轨迹LPV模型的非线性辨识

提出一种基于操作轨迹LPV模型的非线性辨识方法:根据调度变量的操作轨迹,选取若干个典型工作点;在各个典型工作点,进行测试与辨识相应的线性模型;然后,根据工作点测试数据以及各工作点间的过渡数据,辨识出全局插值LPV模型.它降低了测试辨识成本,且算法简单可靠,仿真结果表明了该算法的有效性.     

企业分形分布的判定和应用

尽管分形企业的概念得到了广泛的认同,但企业分布是否是分形这一关键问题一直未得到解决.本文采用行政区划国家标准建立了两个行业的δ-覆盖,并基于信息维数的定义,定量验证了企业分形分布的猜想,并测定了两个行业的分数维数.在此基础上将分数维数与嵌套区域秩序方法相结合,提出一种新的分形分布拟合方法FDF.经实际检验,FDF相比传统的方法,在所需数据量小、稳定性强、适应重点区域等方面,具有显著的特点和优势.最后,本文将该方法应用到一个调度实例问题,不仅给出了跨企业调度的优化范围,而且证明本文方法可以广泛应用于各类依赖于空间分布的企业协同研究.     

并行算法软件库PASL

本文介绍了并行算法软件库ＰＡＳＬ。ＰＡＳＬ库运行在具有共享存储的多处理机上，它可以用于科学工程计算和仿真。     

列车调度指挥信息系统实施分析

介绍了列车调度指挥信息系统的网络结构和功能以及信息数据流程，分析了系统实施后存在的问题，并提出了相关建议。     

用遗传算法解决一类模糊流水车间调度问题

对同时考虑模糊加工时间和模糊交货期的模糊流水车间调度问题进行了研究 ,模糊加工时间用三角模糊数来表示 ,模糊交货期用梯形模糊数来表示。应用遗传算法搜索最优排序 ,在适应度函数处理中引入模糊数处理方法 ,以平均满意度最大作为优化目标。最后给出了实验结果和结论     

极小化不可行量函数的Flow Shop变异问题

讨论一类Flowshop的变异问题。在这类变异问题中 ,给定一个截止工期 ,该工期比Flowshop最优调度中的最大完工时间小。讨论的问题是在全部工件的完工时间不超过截止工期的限制下 ,极小化不可行量函数。这类问题与矩阵函数因子分解有着密切联系。基于对问题的分析 ,证明了这一问题等价于单机调度中极小化类似的延迟量函数。推广了已有的结论。     

并行仿真计算的任务划分问题研究

本文首先分析总结了并行仿真计算任务的三类任务划分方法：算术运算级划分、程序方程级划分和状态变量级划分，然后重点讨论状态变量级的最优划分问题。文中针对同构型的多处理机系统和多计算机系统，分别建立了仿真计算的性能模型，并求出了系统的最优划分粒度。     

LOGISTICS SCHEDULING： ANALYSIS OFTWO-STAGE PROBLEMS

This paper studies the coordination effects between stages for scheduling problems where decision-making is a two-stage process. Two stages are considered as one system. The system can be a supply chain that links two stages, one stage representing a manufacturer; and the other, a distributor It also can represent a single manufacturer, while each stage represents a different department responsible for a part of operations. A problem that jointly considers both stages in order to achieve ideal overall system performance is defined as a system problem. In practice, at times, it might not be feasible for the two stages to make coordinated decisions due to (i) the lack of channels that allow decision makers at the two stages to cooperate, and/or (ii) the optimal solution to the system problem is too difficult (or costly) to achieve.Two practical approaches are applied to solve a variant of two-stage logistic scheduling problems. The Forward Approach is defined as a solution procedure by which the first sta     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai