考虑中断的制造型供应链协调调度模型

供应链协调调度能有效提高企业应对供应链中断的能力。以两阶段制造供应链为研究对象，研究了中断情境下具有交付时间约束的多产品类型制造供应链协调调度问题。制造商接到包含多产品类型的工件加工订单，各工件需经供应商处理为原材料工件后，交付给制造商处理为完成品，各工件均有一个独立的交付期。如果供应商单方面调整工件加工顺序，会导致制造商冲突成本的增加，需双方协商处理。以最小化供应商总拖期交付成本和最小化制造商总冲突成本为目标，基于收益共享契约协调机制，构建了考虑中断的制造型供应链协调调度模型。设计了一个融合自适应邻域搜索算子的混合自适应遗传算法。通过算例仿真，验证了所提模型与算法的有效性。     

Ecological notes of the alien species Godiva quadricolor (Gastropoda: Nudibranchia) occurring in Faro Lake (Italy)

The first record from Sicily of the introduced facelinid nudibranch Godiva quadricolor allowed the detection of trophic relationships with the polycerid Polycera hedgpethi, another non-native nudibranch, and with two bryozoan species, namely the naturalized Cheilostomatida Bugula neritina and the cryptogenic Ctenostomatida Amathia verticillata. The settlement of both nudibranchs was presumably promoted by a trophic shift of P. hedgpethi from the natural prey B. neritina towards the largely available and not exploited A. verticillata. This short food web, without evident links with native fauna and having G. quadricolor as the top predator, is described. A DNA barcoding approach was used to confirm the identity of this facelinid species and to explore the possible genetic divergence occurring among the samples analysed.     

浅谈基于浸润原理的事务安排算法

针对单个安排事务避免冲突的传统方法 ,提出一种基于浸润原理的事物安排算法。该算法采用漫布式将各个事务分摊到各个位置 ,根据条件计算权值 ,并有意造成冲突 ,从而发现冲突位置 ,最后从最不可能冲突的位置入手 ,逐步完成安排过程。该方法事务安排的复杂度为 O(n2× k× x) ,大大减少事务安排所需的时间 .     

Szász-Mirakyan算子对不连续函数的逼近研究

研究用szász-Mirakyan算子S_n(f, x)逼近在(0,+∞)上具有第一类间断点的有界函数了,给出了收敛速度的估计。     

首达渗流中关于时间常数μ的上界估计

对2维首达渗流的时间常数μ给出了一个上界估计．     

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

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

组合逻辑电路的无反变量输入设计

本文阐述了组合逻辑电路无反变量输入的设计思想，并通过设计实例给出了具体的设计方法与步骤．     

投产采区片盒斜井开准方式应用分析

本文以资兴满春岭井为例，运用方案比较法系统分析了笔者提出的“投产采区片盘斜井开拓准备方式”，指出该法简化了开拓部署，改革了采区布置，具有明显的社会经济效益，尤其适合在南方小井推广。图２，表１，参４。     

20世纪上半叶“扬黛抑钗”审美倾向浅探--钗黛形象接受史研究之三

“扬黛抑钗”的审美倾向贯穿于20世纪上半叶的四个历史阶段并各有特色，它鲜明地折射出每个时期的时代意识。     

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