网格资源管理系统模型研究

网格资源管理系统是网格计算系统的重要组成部分。文章分析了网格资源管理系统的功能需求，具体论述了该模型的原型系统，最后介绍了相关研究工作。     

On the use of ‘shortcuts’ in the method of continuous variation (Job's method)

The use of modified Job plot methodology provides a quick and easy means for evaluating host–guest stoichiometry and requires less material than the original method. In this short paper, the results of a recent anion recognition study using thiourea-functionalised norbornanes and [n]polynorbornanes are presented. A significant difference between the plots constructed using the original and modified method was observed and, as such, caution is advised when the modified Job's method is solely used for the determination of host–guest stoichiometry.     

NMR spectroscopic investigation of inclusion complexes between cyclodextrins and the neurotoxin tetramethylenedisulfotetramine

The binding stoichiometry, strength and structure of inclusion complexes formed between the neurotoxin tetramethylenedisulfotetramine (TETS) and both native and modified cyclodextrins (CyDs) were investigated using nuclear magnetic resonance (NMR) spectroscopy. Of all six examined cases, native β‐cyclodextrin (β‐CyD) and its chemically modified counterpart heptakis‐(2,3,6‐tris‐(2‐hydroxypropyl))‐β‐cyclodextrin (2HP‐β‐CyD) were found to associate most strongly with TETS as reflected in the magnitude of their binding constants (K = 537 ± 26 M^?1 for β‐CyD and K = 514 ± 49 M^?1 for 2HP‐β‐CyD). Two‐dimensional rotating‐frame Overhauser effect spectroscopy NMR experiments confirm close proximity of the TETS molecule to both β‐CyD and 2HP‐β‐CyD as intermolecular, through‐space interactions between the H3 and H5 protons located in the interior of the CyD cavity and the methylene protons of TETS were identified. Copyright © 2012 John Wiley & Sons, Ltd.     

Simple matching vs linear assignment in scheduling models with positional effects: A critical review

This paper addresses scheduling models in which a contribution of an individual job to the objective function is represented by the product of its processing time and a certain positional weight. We review most of the known results in the area and demonstrate that a linear assignment algorithm as part of previously known solution procedures can be replaced by a faster matching algorithm that minimizes a linear form over permutations. Our approach reduces the running time of the resulting algorithms by up to two orders, and carries over to a wider range of models, with more general positional effects. Besides, the same approach works for the models with no prior history of study, e.g., parallel machine scheduling with deterioration and maintenance to minimize total flow time.     

校园计算网格作业自适应调度的研究和实现

由于网格资源具有分布、异构、动态、自治等特性。使得网格作业调度成为网格计算中具有挑战性的任务之一。针对校园高性能计算资源负载不均衡、管理模式不统一的问题，提出了校园计算网格自适应调度系统的解决方案。详细研究了网格作业的白适应调度技术，设计了含有负载均衡能力的资源动态信息收集模型，并给出自适应调度算法。实现了校园范围内高性能计算资源的负载均衡和统一的资源管理。     

thGridJob:面向空间信息网格的SOA结构任务框架

文章提出了一种基于SOA结构的任务框架来支持空间信息网格(SIG)中的长时间处理服务并将其命名为thGridJob。thGridJob采用三层结构,为用户和任务开发者提供了不同的编程接口。用户可以通过一系列的Web服务操作来提交和控制任务实例,任务开发者可以使用Java语言、脚本语言和工作流描述语言来开发任务实例。文章还采用Java语言开发设计和实现了一个thGridJob实现以及一个基于Web的用户界面,为SIG用户和任务开发者服务。     

Multi-level lot sizing and job shop scheduling with compressible process times: A cutting plane approach

This paper proposes an integer linear programming formulation for a simultaneous lot sizing and scheduling problem in a job shop environment. Among others, one of our realistic assumptions is dealing with flexible machines which enable the production manager to change their working speeds. Then, a number of valid inequalities are developed based on problem structures. As the valid inequalities can help in reducing the non-optimal parts of the solution space, they are dealt with as some cutting planes. The proposed cutting planes are used to solve the problem in (i) cut-and-branch, and (ii) branch-and-cut approaches. The performance of each cutting plane is investigated with CPLEX 12.2 on a set of randomly-generated test data. Then, some performance criteria are identified and the proposed cutting planes are ranked by TOPSIS method.     

Unbounded parallel batch scheduling with job delivery to minimize makespan

We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4.     

A general model for cyclic machine scheduling problems

A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines.It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated.     

基于模糊TOPSIS法的职业选择定量分析

由于职业选择受多种因素的影响,且许多因素又具有模糊不确定性,单纯地从定性的角度无法准确清晰地进行选择判断.为解决这一问题,本文运用模糊TOPSIS法对职业选择问题进行定量分析.首先,从个人兴趣爱好、单位的工资收入水平、地理位置、单位性质、发展前景、继续深造的条件和机会、发展机会等,建立职业选择的评价指标体系;然后,采用模糊集理论与专家综合评判相结合的方法求出模糊评价指标的概率并给出所有评价指标的权数;接着,以模糊数学和传统TOPSIS(逼近理想解的排序法)法为基础,建立职业选择评价方法;最后,以某大学生职业选择为例,验证该评价方法的有效性.结果表明,运用模糊TOPSIS法对职业选择定量分析是可行的.