基于顾客化大量生产模式的计划平准化模型的最优算法的研究

根据无库存生产方式的思想 ,运用循环排序的方法 ,综合考虑产品加工时间和产品需求这两个参量 ,对基于顾客化大量生产模式下的计划平准化模型的最优算法进行了研究 ,提出了确定产品循环期 CT(或产品出产节拍 )下界的公式 ,并在理论上进行了证明     

一种计算工作时间参数新方法

为了编制和优化施工进度计划,计算构成施工项目的各项工作最早开始时间、最迟开始时间、最早完成时间、最迟完成时间、总时差和自由时差等时间参数十分重要.提出了一种计算工作时间参数新方法.该方法以工作完成时间为决策变量,通过建立和求解线性规划模型来得到各种工作时间参数.其建模思路清晰,不需绘制网络图,能用通用办公软件EXCEL求解.模拟计算表明,用该方法与用标准网络计划技术计算出的工作时间参数完全一致.     

Periodic schedules for linear precedence constraints

We consider the computation of periodic cyclic schedules for linear precedence constraints graphs: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such that the difference of iterations is a linear function. The objective function is the minimization of the maximal period of a task.We recall first that this problem may be modelled using linear programming. A polynomial algorithm is then developed to solve it for a particular class of linear precedence graphs called unitary graphs. We also show that a periodic schedule may not exist for unitary graphs. In the general case, a decomposition of the linear precedence graph into unitary components is computed and we assume that a periodic schedule exists for each of these components. Lower bounds on the periods are exhibited and we show that an optimal periodic schedule may not achieve them. The notion of quasi-periodic schedule is then introduced and we prove that this new class of schedules always reaches these bounds.     

双密度层流化床形成机理

对一种可用于三产品分选的双密度层流化床的形成机理进行了实验和理论研究，分析了流化床中的颗粒受力，论证了锥形段的强化分离功能．研究结果表明，特殊的床型设计强化了二元粒子的分离，适宜的流化气速可使各分选带内的床层密度相对均匀，二者结合可形成能满足选煤工艺要求的双密度层流化床．     

余维≤5的光滑函数在C^∞（R^n,R）中的稠密性

证明了在函数空间Ｃ＾∞（Ｒ＾ｎ，Ｎ）中，适合条件“在每一点ｘ，函数ｆ作为ｘ点的芽，余维≤５”的光滑函数全体是Ｃ＾∞（Ｒ＾ｎ，Ｒ）中的稠密子集，从而使“几乎所有”的光滑函数能够选用Ｔｈｏｍ的７种突变模型。     

Single machine unbounded parallel-batch scheduling with forbidden intervals

In this paper we consider the single machine parallel-batch scheduling with forbidden intervals. There are some forbidden intervals in which the machine cannot be available. The jobs are processed in batches form in the remaining free time-slots without preemption, where the processing time of a batch is defined to be the maximum processing time of the jobs in this batch. We show that, when the objective is bottleneck form, maximum lateness, or makespan with release dates of jobs, the considered problem can be solved in polynomial time.     

Measurement of dense plasma temperature of the shock-compressed silicon

Measurements of the brightness temperature and compressibility of a dense silicon plasma formed by powerful shock waves (SWs) passing through a single-crystal sample have been carried out. Plane SWs were created using an explosive technique: the traditional plane acceleration of a steel driver plate made it possible to obtain pressures in silicon up to 133 GPa, and the use of “Mach” cumulative generators realized the pressures up to 510 GPa. The shock Hugoniot of silicon was determined by the impedance matching with α-quartz as the reference. The intensity of emitted thermal radiation was measured in the infrared range λ ∼ 1.5 μm, where silicon is optically transparent, and in the visible range of the spectrum. A significant (up to five times) understatement of the measured values of the brightness temperature in comparison with the values calculated by the equation of state was found. Taking into account the reflective properties of the SW in silicon does not lead to an agreement with the experiment. The estimates of relaxation processes behind the shock front suggest the presence of a zone of the establishment of ionization equilibrium with a width of ∼10 μm.     

分裂节点法分析虚拟社会网络中的重叠社区

虚拟社会网络分析,尤其是将复杂网络按照连接关联的紧密程度划分为多个集群,是数据挖掘领域的一个研究热点。基于现实社会中成员一般与多个团体相关联这一事实,旨在提出带有重叠集群的抽象网络分割模型及其算法,主要讨论由这一数学模型引出的新问题及基于层次聚类算法提出的解决方案,并且阐述分裂节点法的理论基础、复杂度分析,对比传统算法来证明该方法的优势与不足,及在其他领域的应用价值。     

一种面向教学的排课冲突检测算法

排课算法可在大规模空间上对排课元素实施自动编排.然而,目前未见报道有关针对已排好的课表实施正确性检测的通用全自动方法.为此,给出课表所需满足约束条件的形式化描述;在此基础上,分别给出3个子算法以检测3种约束条件;顺序调用这些子算法,即可得到一种面向教学实践的排课冲突检测算法.检测实验证实了新方法的有效性.