基于分布式系统的GUI自动化测试框架

目前,虽然很多工具可以用来实现自动化测试,但是现有的自动化测试过程很大程度上还需要人工参与来完成.如何能利用机器仿真来取代大规模的人工操作成为提升测试效率的关键.首先介绍了分布式作业调度系统中的作业调度原理,然后在基于用WinRunner实现GUI自动化测试的基础上,提出了适合GUI自动化测试的框架,最后给出了一个基于该框架的仿真测试系统实例,对如何全面实现自动化测试过程进行了详细讨论.     

求解Job Shop调度问题的混合蚁群算法研究

为了解决单一算法求解Job Shop调度问题存在的不足，该文提出了一种混合算法，将蚁群算法用于全局搜索。针对蚁群算法易于陷入局部最优的情况，提出了一种基于关键工序的邻域搜索方法，将使用此邻域搜索方法的TS算法作为局部搜索策略。利用TS算法较强的局部搜索能力，提高了蚁群算法的优化能力，达到改善Job Shop调度问题解的质量。实验结果表明，混合算法在较短的时间内，找到了FT10、LA24、LA36等典型benchmarks问题的最优解，得到的makespan的平均值较并行遗传算法(PGA)和TSAB算法均有所提高。     

An agent for selecting optimal order set in EC marketplace

For most small manufacturing companies, the selection and completion of orders placed by buyers are closely linked to the load status of their production lines. The decision to accept an order, or the selection of optimal order set, critically depends on the production schedule when orders exceed production capacity. However, production scheduling is mainly performed by human experts, and small companies lack resources to implement such a task. As a result, most small manufacturers suffer from the difficulty to meet due dates or to make proper decision in accepting new orders. To address this problem, this paper develops an automatic agent that selects an optimal set of orders using commonly available Internet technology. The main engine of the selection agent is based on a typical job shop scheduling model, formulating and implementing it as an Integer Program (IP) model. We also translate IP into Genetic Algorithm (GA) to address its NP-hard problem. We conclude with a suggestion for an agent architecture that tackles Web-based order selection problems.     

具有最大作业延迟的生产调度优化算法及仿真

成组作业优化调度问题中的作业根据其加工特点要求可分成若干作业类。同一类的作业连续加工，其后的作业不需要机器设置花费，而不同类的作业连续加工，其后的作业需要机器设置花费。当优化目标是最大作业延迟时，单机成组作业优化调度是HP—hard。本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。仿真实验表明该算法具有良好的性能。     

混合遗传算法在车间作业调度问题中的应用

本文在对车间作业调度问题及其调度方法进行描述的基础上，将模拟退火算法引入遗传算法，提出了混合遗传算法(GASA)，并将其应用于解决车间作业调度问题。     

一个基于多Agent的PCB装配调度系统

PCB装配调度是一个job shop调度问题。本文针对这一问题设计了一个基于多agent调度系统模型，系统的最大特点是将任务和优先权机制与基于合同网协议和KQML消息的竞标机制两者相结合。     

Finding multiple solutions in job shop scheduling by niching genetic algorithms

The interest in multimodal optimization methods is increasing in the last years. The objective is to find multiple solutions that allow the expert to choose the solution that better adapts to the actual conditions. Niching methods extend genetic algorithms to domains that require the identification of multiple solutions. There are different niching genetic algorithms: sharing, clearing, crowding and sequential, etc. The aim of this study is to study the applicability and the behavior of several niching genetic algorithms in solving job shop scheduling problems, by establishing a criterion in the use of different methods according to the needs of the expert. We will experiment with different instances of this problem, analyzing the behavior of the algorithms from the efficacy and diversity points of view.     

PBS中的任务调度以及一类资源分配失效的解决

首先对PBS强大的任务调度功能做了详细的介绍，然后实现了PBS和MPICH的绑定，从而解决了使用PBS和MPICH所带来的资源分配失效的问题。     

An improved approximation algorithm for single machine scheduling with job delivery

In single machine scheduling with release times and job delivery, jobs are processed on a single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jobs. The vehicle can deliver at most c jobs in a shipment. The delivery completion time of a job is defined as the time in which the delivery batch containing the job is delivered to the customer and the vehicle returns to the machine. The objective is to minimize the makespan, i.e., the maximum delivery completion time of the jobs. We provide an approximation algorithm for this problem which is better than that given in the literature, improving the performance ratio from 5/3 to 3/2.     

高校教师组织承诺与工作绩效关系研究

以浙江省8所高校356名专职教师为研究对象,依据调查问卷数据,分析了高校教师组织承诺与工作绩效间的关系,得到了高校教师工作绩效的5因素模型,得出了教师不同的个体特征在组织承诺和工作绩效上有显著差异表现、教师的组织承诺对其工作绩效有显著影响力的结论,根据结论提出了关于高校人力资源管理的相关建议.