preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...

We classify, in terms of the structure finite group G, all algebras KG for which right ideals are annihilators principal left ideals. This means language coding theory that we classify code-checkable have been considered so far only abelian groups G. Optimality checkable codes and asymptotic results discussed.

A multi-objective heuristic particle swarm optimiser (MOHPSO) based on Pareto multi-objective theory is proposed to solve multi-objective optimality problems. The optimality objectives are the roof displacement and structure weight. Two types of structure are analysed in this paper, a truss structure and a framework structure. Performance-based seismic analysis, such as classical and modal push...

The coset pattern matrix (CPM) is formally defined as an elaborate characterization of the aliasing patterns of a fractional factorial design. The possibility of using CPM to check design isomorphism is investigated. Despite containing much information about effect aliasing, the CPM fails to determine a design uniquely. We report and discuss small nonisomorphic designs that have equivalent cose...

Abstract. A simple step-stress accelerated life testing plan is considered when the failure times in each level of stress are geometrically distributed under Type-I censoring. The problem of choosing the optimal plan is investigated using the asymptotic variance-optimality as well as determinant-optimality and probability-optimality criteria. To illustrate the results of the paper, an example i...

This paper studies certain inverse problems in the optimal frequency-domain synthesis of robust controllers, in both the 2-norm and the infinity-norm. These inverse problems identify the class of controllers which are optimal for some choice of weights. Their implications for loopshaping are discussed. Keywords—Inverse optimality, loopshaping, H2 control, H∞ control. c.t/ g− + K.s/ u.t/ G0.s/ g...

‎in this paper‎, ‎some kkt type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (minpp) are established‎. ‎we achieve‎ ‎this by employing a lagrange function for minpp‎. ‎in addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

We prove that for a finitely generated infinite nilpotent group G with a first order structure (G, ·, . . .), the connected component G of a sufficiently saturated extension G of G exists and equals ⋂ n∈N {g : g ∈ G}. We construct a first order expansion of Z by a predicate (Z,+, P ) such that the type-connected component Z ∅ is strictly smaller than Z. We generalize this to finitely generated ...

The problem of the optimal approximation circular arcs by parametric polynomial curves is considered. optimality relates to Hausdorff distance and have not been studied yet in literature. Parametric low degree are used a geometric continuity prescribed at boundary points arc. A general theory about existence uniqueness approximant presented rigorous analysis done for some special cases which cu...

We discuss the classical efficiency criteria in density estimation and propose some variants. The context is a general density estimation scheme that contains the cases of i.i.d. or dependent random variables, in discrete or continuous time. Unbiased estimation, optimality and asymptotic optimality are considered. An example of a density estimator that satisfies some suggested criteria is given...