工件加工时间退化且可拒的带优势关系流水作业问题的动态规划算法

The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied. The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty. For each objective, polynomial time algorithms based on dynamic programming were presented.     

一类基于人工免疫系统与极值优化的混合算法求解流水作业调度问题

The permutation flowshop scheduling problem (PFSP) is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algorithm which combines the strong global search ability of artificial immune system (AIS) with a strong local search ability of extremal optimization (EO) algorithm. The proposed algorithm is applied to a set of benchmark problems with a makespan criterion. Performance of the algorithm is evaluated. Comparison results indicate that this new method is an effective and competitive approach to the PFSP.     

A further analysis of the ethics of representation in virtual reality: Multi-user environments

This is a follow-up article toPhilip Brey's ``The ethics of representation andaction in Virtual Reality' (published in thisjournal in January 1999). Brey's call for moreanalysis of ethical issues of virtual reality(VR) is continued by further analyzing issuesin a specialized domain of VR – namelymulti-user environments. Several elements ofBrey's article are critiqued in order to givemore context and a framework for discussion.Issues surrounding representations ofcharacters in multi-user virtual realities aresurveyed in order to focus attention on theimportance of additional discussion andanalysis of specialized aspects of VR.     

基于两级的公平调度算法

为了保证对各个端口的不同优先级(PRl)的数据包的公平调度，本文提出了一种相适应的算法解决接口间的公平调度和接口内不同优先级间的公平调度。     

计算机集群技术概述

集群(cluster)技术是一种较新的技术,通过集群技术,可以在付出较低成本的情况下获得在性能、可靠性、灵活性方面的相对较高的收益,其任务调度则是集群系统中的核心技术。本文就集群系统的定义、发展趋势、任务调度等问题进行了简要论述。     

面向任务优先级和Deadline约束的网格QoS任务调度算法研究

基于网格QoS的属性分析,对单一性能评价任务调度算法进行了改进。改进后的基于QoS的网格任务调度算法在make span以及任务接受率等的综合性能上较传统的调度算法具有较大优越性。     

Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on m Identical Machines

In this paper, a semi on-line version on m identical machines M1 , M2, …, Mm ( m ≥ 3 ) was considered, where the processing time of the largest job is known in advance. Our goal is to maximize the minimum machine load, an NPLS algorithm was presented and its worst-case ratio was proved to be equal to m - 1 which is the best possible value. It is concluded that if the total processing time of jobs is also known to be greater than (2 m - 1 )Pmax where pmax is the largest job‘s processing time, then the worstcase ratio is 2 - 1/m.     

Huffman树在公交车调度问题中的应用

在公交车调度问题中,本文提出一种新的方法,即Huffman最优树算法,该算法在电报编码和计算机指令系统优化等许多方面被广泛应用.合理解决公交车调度问题对于增加公交车公司的利益,满足乘客乘车需要都有重要意义.     

工件加工时间恶化问题的若干研究

主要研究关于工件加工时间恶化的若干问题,给出了最大完工时间问题的一些性质、总完工时间问题的算法和性质,并根据实际问题,设计了一些新模型,相应地给出了该问题所具有的性质及一些简单算法．