Data envelopment analysis (DEA) – Thirty years on

This paper provides a sketch of some of the major research thrusts in data envelopment analysis (DEA) over the three decades since the appearance of the seminal work of Charnes et al. (1978) [Charnes, A., Cooper, W.W., Rhodes, E.L., 1978. Measuring the efficiency of decision making units. European Journal of Operational Research 2, 429–444]. The focus herein is primarily on methodological developments, and in no manner does the paper address the many excellent applications that have appeared during that period. Specifically, attention is primarily paid to (1) the various models for measuring efficiency, (2) approaches to incorporating restrictions on multipliers, (3) considerations regarding the status of variables, and (4) modeling of data variation.     

Parallel machine scheduling with nested processing set restrictions

We consider the problem of scheduling a set of n independent jobs on m parallel machines, where each job can only be scheduled on a subset of machines called its processing set. The machines are linearly ordered, and the processing set of job j   is given by two machine indexes _aj$a_j$ and _bj$b_j$; i.e., job j   can only be scheduled on machines _aj,_aj+1,…,_bj$a_j\text{,}{a}_j+1\text{,}\dots \text{,}{b}_j$. Two distinct processing sets are either nested or disjoint. Preemption is not allowed. Our goal is to minimize the makespan. It is known that the problem is strongly NP-hard and that there is a list-type algorithm with a worst-case bound of 2-1/m$2-1/m$. In this paper we give an improved algorithm with a worst-case bound of 7/4. For two and three machines, the algorithm gives a better worst-case bound of 5/4 and 3/2, respectively.     

Projection and restriction methods in geometric programming and related problems

Mathematical programming problems with unattained infima or unbounded optimal solution sets are dual to problems which lackinterior points, e.g., problems for which the Slater condition fails to hold or for which the hypothesis of Fenchel's theorem fails to hold. In such cases, it is possible to project the unbounded problem onto a subspace and to restrict the dual problem to an affine set so that the infima are not altered. After a finite sequence of such projections and restrictions, dual problems are obtained which have bounded optimal solution sets andinterior points. Although results of this kind have occasionally been used in other contexts, it is in geometric programming (both in the original psynomial form and the generalized form) where such methods appear most useful. In this paper, we present a treatment of dual projection and restriction methods developed in terms of dual generalized geometric programming problems. Analogous results are given for Fenchel and ordinary dual problems.This research was supported in part by Grant No. AFOSR-73-2516 from the Air Force Office of Scientific Research and by Grant No. NSF-ENG-76-10260 from the National Science Foundation.The authors wish to express their appreciation to the referees for several helpful comments.     

矩形掺杂光子晶体中电磁波的模式和缺陷模

利用一维矩形掺杂光子晶体中电磁波横向受限的条件,推导出电磁波在其中各个模式满足的关系式,利用它研究了电磁波各模式的特性.利用特征法研究了电磁波的缺陷模随模式量子数和矩形边长的变化规律,得出了一维矩形掺杂光子晶体缺陷模的新结构. 关键词： 矩形光子晶体 受限 模式 缺陷模     

圆柱形光子晶体中电磁波的模式和带隙

利用电磁波在一维圆柱光子晶体中径向受限的条件,推导出电磁波在一维圆柱光子晶体中各个模式满足的关系式。研究了各个模式的特征。计算出TE波和TM波各模式的禁带随模式量子数、圆柱半径以及入射角的变化规律。得出了一些不同于一维非受限光子晶体带隙的新结构。     

Promoting symmetric weight selection in data envelopment analysis: A penalty function approach

Traditionally, data envelopment analysis models assume total flexibility in weight selection, though this assumption can lead to several variables being ignored in determining the efficiency score. Existing methods constrain weight selection to a predefined range, thus removing possible feasible solutions. As such, in this paper we propose the symmetric weight assignment technique (SWAT) that does not affect feasibility and rewards decision making units (DMUs) that make a symmetric selection of weights. This allows for a method of weight restrictions that does not require preference constraints on the variables. Moreover, we show that the SWAT method may be used to differentiate among efficient DMUs.     

Absalom: Balancing assembly lines with assignment restrictions

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On the other hand, a number of real-world extensions of SALBP have been introduced but solved with straight-forward and simple heuristics in many cases. Therefore, there is a lack of procedures for exactly solving such generalized ALBP.In this paper, we show how to extend the well-known solution procedure Salome [Scholl, A., Klein, R., 1997. Salome: A bidirectional branch-and-bound procedure for assembly line balancing. Informs J. Comput. 9 319–334], which is able to solve even large SALBP instances in a very effective manner, to a problem extension with different types of assignment restrictions (called ARALBP). The extended procedure, referred to as Absalom, employs a favorable branching scheme, an arsenal of bounding rules and a variety of logical tests using ideas from constraint programming.Computational experiments show that Absalom is a very promising exact solution approach although the additional assignment restrictions complicate the problem considerably and necessitate a relaxation of some components of Salome.     

均值限制相似优势粗糙集及决策分析模型研究

针对不完备信息系统中的偏好多属性决策问题,提出了一种基于均值限制相似优势粗糙集的决策分析模型.首先提出了均值限制相似优势关系的概念;然后在均值限制相似优势关系下得到知识的粗糙近似和属性约简,给出了分类决策规则.与相似优势关系和限制相似优势关系比较研究的结果表明:均值限制优势关系的分类精度和质量介于二者之间,而分类误差率则优于相似优势关系和限制相似优势关系,得到的决策规则可信度更高,决策模型与实际情况更加相符.     

包含多余回归变量的错误指定模型的随机约束Liu估计

对由于包含多余回归自变量而导致的错误指定线性回归模型,本文导出了回归系数的最小二乘估计,普通混合估计以及随机约束Liu估计,并在均方误差矩阵准则下对这三个估计的优良性进行了比较,给出了随机约束Liu估计优于最小二乘估计和普通混合估计的充要条件.此外,对它们所对应的经典预测值的优良性也进行了讨论.     

Constitutive structure in coupled non-linear electro-elasticity: Invariant descriptions and constitutive restrictions

A constitutive framework for electro-sensitive materials in the context of non-linear elasticity is analyzed. Constitutive equations are given in terms of energy functions that depend on several invariants. The study includes both the analysis of the invariants, which are present in the energy functions, and the analysis of constitutive restrictions that have to be obeyed by the constitutive functions. Isotropic as well as non-isotropic electro-sensitive elastomers are studied. The set of invariants that describe each material model is analyzed under two homogeneous deformations: (i) an uniaxial elongation and (ii) a simple shear deformation. These deformations are chosen since they are relevant to specific experiments, from which one may try to fit constitutive equations. The constitutive restrictions developed are based on classical ones used for isotropic non-linear elastic materials, in particular, are based on the Baker–Ericksen inequality and the ellipticity condition.