Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

Too much Western bias? The need for a more culturally adaptable approach to post-conflict security sector reform

The existing guidelines for security sector reform (SSR) tend to draw on theoretical work in the field of civil–military relations, which in turn has been derived from Western, liberal democratic models of governance. Although guidelines strongly advise that local culture and context need to be considered when drawing up objectives for post-conflict SSR programmes, this is not often reflected in practice. This article considers some of the reasons for this, citing both in-country challenges and donor-related issues, and suggests that one of the biggest problems is a lack of alternative, non-orthodox models of civil–military relations to draw upon. It is further suggested that elements of suitable alternative models may be found in states which possess political structures not entirely dissimilar to the Western, liberal democratic ideal, but which can offer different perspectives. Detailed research of these structures should produce a pool of sub-models which could then be employed to create bespoke, culturally appropriate objectives for use in post-conflict SSR programmes.     

Security sector reform in Africa: Donor approaches versus local needs

Many African states have security sector reform (SSR) programs. These are often internationally funded. But how do such programs account for previously existing security institutions and the security needs of local communities? This article examines SSR all over Africa to assess local ownership and path dependency from a New Institutionalist perspective. It finds that SSR, particularly in post-conflict countries, tends to be driven by ideas and perceptions of international donors promoting generalized blueprints. Often, such programs only account in a very limited way for path-dependent aspects of security institutions or the local context. Hence, the reforms often lack local participation and are thus not accepted by the local community eventually.     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

基于数据链的航空作战进程研究

研究了数据链支持下的航空作战兵力变化问题。将空战能力指数通过映射关系转化为平均战斗力水平,从数学理论上证明了二者具有等价性。结合平均战斗力水平,建立了基于数据链的改进蓝彻斯特空战模型及具有增援力量的作战模型。仿真分析了等效实力比、不同初始值以及增援时刻的不同对空战进程的影响,结果表明数据链具有提高作战效能和改变战局的作用。实验发现了在增援作战时,存在"局部最优增援时刻点"这一重要结论。     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

试论大学英语翻译教学中本土文化的引入——以兵团文化为例

文化交流可以促进相互了解、共同繁荣。文化没有优劣之分,因此,文化交流应该是平衡的。这种交流离不开翻译。翻译教学是培养翻译人才的主要手段。教材是教学三要素之一,其重要性自不待言。我们目前的翻译教材在很大程度上仍然偏重文学,忽略实用文体的翻译,而且不可能顾及各地文化,因此在利用现有的翻译教材进行翻译教学时,有必要增加本地文化的翻译内容。兵团文化是一种崭新、独特的文化,更有必要在翻译教学中占有一席之地。     

漏磁检测的励磁装置优化设计

为了提高漏磁检测的灵敏度,利用ANSYS软件建立了漏磁检测励磁装置的三维有限元模型,研究了钢板的厚度、永磁体厚度、磁极面积以及磁化间隙等因素对钢板局部磁化效果的影响,得到了钢板磁化强度随永磁体几何参数改变时的变化规律,提出了永磁磁化方式下励磁装置优化设计的基本方法,对励磁装置各部分参数进行了优化设计．实验证明,优化设计的励磁装置能改善磁化效果,提高检测灵敏度．     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

一种改进的指纹图像局部方向场匹配方法

指纹方向场真实地反映了指纹图像中本质的纹理特征,包括了指纹的基本形状、结构和走势。定义了局部方向场图像的描述方法,可以根据纹理信息有效地描述并区分不同的细节点。在低质量指纹图像,特别是存在较严重非线性形变的指纹图像中,细节点方向属性不够可靠,使得以细节点对作为参考对齐局部方向场图像的方法效果不佳。提出一种改进的局部方向场图像对齐和匹配方法,能够明显改善局部对齐效果,提高局部匹配的准确性,从而更加有效地区分对应和不对应细节点。实验结果验证了提出方法的有效性。