基于MMAS算法的带到达时间批调度问题研究

研究了工件带到达时间的目标为极小最大完工时间(Cmax)的单机批调度问题,采用最大-最小蚂蚁系统(max-min ant system,MMAS)进行求解.针对问题带到达时间以及分批的特性,提出了两种候选列表(candidate list)构建批序列,有效地缩小了搜索空间的维度;考虑两种候选列表的工件对构造解具有不同的影响,针对不同的候选列表设计了相应的启发式信息.仿真实验部分从求解质量和时间性能两方面比较了本文提出的算法和标准的蚂蚁系统(ant system,AS)算法以及使用不同候选列表的MMAS算法.结果表明,本文的算法在质量和时间两方面均全面优于标准的AS算法,而提出的候选列表使得该算法在大幅度提高时间性能的同时,仍然能够取得近似最优解,从而在求解质量和时间性能两方面取得平衡.     

一种基于S-粗集的实时调度建模方法

基于S-粗集理论(Singular roush sets)提出了一种车间作业实时调度建模方法.在动态加工环境下,考虑有工件加工完成、工件到期时间改变和急加工工件到来等实时事件发生,研究了实时调度窗口工件的再选择与再调度问题,建立了基于S-粗集的车间作业实时粗调度模型,把S-粗集理论成功地应用于实时调度领城.仿真算例表明,利用该方法不仅能适应动态的工件加工环境,减小调度问题的求解规模,而且能够减少动态再调度次数.     

A Heuristic for the Job Scheduling Problem with a Common Due Window on Parallel and Non-Identical Machines

1. INTroDUCTIONThe emergence of JIT (Just in Time) management tee~gy opens up a recency research field for the jobscheduling and production managemellt. As its farther develOPment, the earnness-tardiness job schedulingproblem becomes a hot research point over y6ars. conference [1] gives a review on job scheduling problem withearnness and tardiness penalties. Reference [2] p~s another scheduling problem for minimizing the rangeof lateness on a single machine, and reference [3] giVes a he…     

基于多智能体的虚拟企业任务调度研究

采用多智能体技术构建了虚拟企业任务调度运行模型,该模型包括管理智能体、任务智能体、资源智能体等。针对模型中的调度优化问题,以资源智能体所承担的生产任务为对象,综合考虑资源智能体自身已确定的生产任务、完成虚拟企业生产任务所需作业时间及转运时间等因素,建立了以生产延续时间最小化为目标的优化调度模型,并给出了粒子群优化求解算法。工业机械手实例说明了任务调度模型及实现方法的有效性。     

An effective estimation of distribution algorithm for parallel litho machine scheduling with reticle constraints

In order to improve the scheduling efficiency of photolithography, bottleneck process of wafer fabrications in the semiconductor industry, an effective estimation of distribution algorithm is pro-posed for scheduling problems of parallel litho machines with reticle constraints, where multiple reti-cles are available for each reticle type.First, the scheduling problem domain of parallel litho ma-chines is described with reticle constraints and mathematical programming formulations are put for-ward with the objective of minimizing total weighted completion time.Second, estimation of distribu-tion algorithm is developed with a decoding scheme specially designed to deal with the reticle con-straints.Third, an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally, simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.     

四卡问题的新视角——社会契约理论

Cosmides所提出的社会契约理论表明,人的推理能力具有领域特殊性的和内容依赖性。这不仅挑战了传统的推理假设,更以一种超越常规的方式促进了心理学特别是认知和发展心理学的发展。     

多线语音应用程序设计

介绍了事件驱动状态的工作原理，在此基础上，给出了一种多线语音应用程序设计方案。     

Concurrent transmission with minimal SR-pair interference in WiMAX mesh networks

Performance of wireless mesh networks can be greatly improved by spatial reuse (SR), therefore, lots of algorithms have been proposed to maximize the number of concurrent transmissions. However, most methods only considered the interference brought by the sender nodes. In this paper, we study the interference model in WiMAX mesh networks and propose a minimal SR-pair interference model to perform concurrent transmissions in both uplink and downlink directions. Simulation results show that our model is more efficient and stable, i.e., it increases the number of concurrent transmissions and its performance is constant and independent of transmission directions. Biography: XIONG Qing(1978–), male, Ph. D., research direction: wireless mesh networks.     

三台平行机上四个约束链的排序问题

考虑四条优先约束链的n个工件在三台平行机上的排序问题,目标是极小化最大机器完工时间.文中说明此问题至少为NP-hard的,并通过一个伪多项式时间算法和一个完全多项式时间近似规划来描述此问题的复杂性.     

基于NET的高校物资管理系统研究

针对高校的特点，对物资管理的现状进行了分析。按照NET框架的规范，提出了一套适合高校物资管理系统的设计方案，并对库存量定量分析、调度策略、供应链和配送方案等关键功能进行了阐述。