A note on the influence of missing operations on scheduling problems

This paper attempts to resolve the existing confusion concerning missing operations. Scheduling problems are classified in two groups: (i) null-continuous (NC)—comprising the problems where an optimal schedule remains optimal on replacement of arbitrarily small processing times (existing operations) with zeros (missing operations); (ii) null-discontinuous (NDC)—comprising those problems which are not null-continuous.     

Approximating nondominated sets in continuous multiobjective optimization problems

Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems

Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Incremental approximation of optimal allocations

This paper concerns the approximation of optimal allocations by δ allocations. δ allocations are obtained by fixing an increment δ of effort and deciding at each step upon a single cell in which to allocate the entire increment. It is shown that δ allocations may be used as a simple method of approximating optimal allocations of effort resulting from constrained separable optimization problems involving a finite number of cells. The results are applied to find δ allocations (called δ plans) which approximate optimal search plans. δ plans have the property that as δ → 0, the mean time to find the target using a δ plan approaches the mean time when using the optimal plan. δ plans have the advantage that. they are easily computed and more easily realized in practice than optimal plans which tend to be difficult to calculate and to call for spreading impractically small amounts of effort over large areas.     

Transportation problems with aggregated destinations when demands are uncertain

Transportation problems with uncertain demands are useful applied models themselves, and also they represent in a formal way the problem of estimating demands for use in deterministic models. We consider the effects of using a small, aggregate model of this type in place of a larger, more detailed one. Formulation of the aggregate objective function turns out to depend on how one chooses to use (disaggregate) the solution; several alternative methods are examined. Bounds are derived on the error induced by the approximation, thus facilitating comparison of alternative aggregations. We also consider the problem of estimating demands for an aggregate-level deterministic problem. In a specific sense, it is often not the case (as one might expect) that such aggregate demands are easier to estimate than the detailed demands. This is because aggregation and centralization are not the same thing.     

线-面传输线Taylor与Agrawal模型解的比较

基于Maxwell方程推导描述外电磁场对导线的耦合传输线模型有Taylor,Agrawal和Rachidi三种模型,每个耦合公式给出相同的传输线响应,但是它们之间又有细微的差别,Nucci和Rachidi通过数值方法验证在圆柱形雷电电磁场激励下这三种线-面传输线模型在负载终端具有相同的全电压解。本文采用解析的方法对线-面传输线Taylor模型和Agrawal模型进行研究,获得了这两个模型基于平面电磁波激励下的终端负载响应的解析解,证明了它们的解析解是相同的。也就是说,线-面传输线Taylor模型和Agrawal模型其实是对同一个解的不同描述。因此,在实际应用时,可以根据具体情况来选择不同的传输线模型进行求解。     

Quadratic as parametric linear programming

This paper describes an approximate solution procedure for quadratic programming problems using parametric linear programming. Limited computational experience suggests that the approximation can be expected to be “good”.     

基于物理光学方法二面角反射器一维距离像特征信号计算

二面角是众多雷达目标中的典型散射结构,是典型的二次散射体,其特征的识别对于复杂目标的识别具有重要的意义。本文中首先在频域内应用PO光学计算方法得到二面角的散射信号,通过IFT变换得到时域散射信号。采用幅度调制信号与目标的时域散射信号进行卷积,即得到目标的距离像     

MABAC method for multiple attribute group decision making under q-rung orthopair fuzzy environment

As the generalization of intuitionistic fuzzy set (IFS) and Pythagorean fuzzy set (PFS), the q-rung orthopair fuzzy set (q-ROFS) has emerged as a more meaningful and effective tool to solve multiple attribute group decision making (MAGDM) problems in management and scientific domains. The MABAC (multi-attributive border approximation area comparison) model, which handles the complex and uncertain decision making issues by computing the distance between each alternative and the bored approximation area (BAA), has been investigated by an increasing number of researchers more recent years. In our article, consider the conventional MABAC model and some fundamental theories of q-rung orthopair fuzzy set (q-ROFS), we shall introduce the q-rung orthopair fuzzy MABAC model to solve MADM problems. at first, we briefly review some basic theories related to q-ROFS and conventional MABAC model. Furthermore, the q-rung orthopair fuzzy MABAC model is built and the decision making steps are described. In the end, An actual MADM application has been given to testify this new model and some comparisons between this novel MABAC model and two q-ROFNs aggregation operators are provided to further demonstrate the merits of the q-rung orthopair fuzzy MABAC model.     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

An approximation for the waiting time distribution in single server queues

Single server queues with general interarrival and service times are approximated by queues with two-point (Bernoulli) interarrival times and exponential service times. The parameters are chosen such that the first four moments of the difference of the service times and interarrival times in the approximating system equal those of the original system. The aptness of the approximation is discussed and some examples are presented comparing the exact and approximate waiting time distributions. A more complicated approximation is presented using the dual system (exponential arrivals, Bernoulli service) for those cases where the original approximation cannot be used.     

A computationally efficient approach for determining inventory levels in a capacitated multiechelon production‐distribution system

The system under study is a single item, two‐echelon production‐inventory system consisting of a capacitated production facility, a central warehouse, and M regional distribution centers that satisfy stochastic demand. Our objective is to determine a system base‐stock level which minimizes the long run average system cost per period. Central to the approach are (1) an inventory allocation model and associated convex cost function designed to allocate a given amount of system inventory across locations, and (2) a characterization of the amount of available system inventory using the inventory shortfall random variable. An exact model must consider the possibility that inventories may be imbalanced in a given period. By assuming inventory imbalances cannot occur, we develop an approximation model from which we obtain a lower bound on the per period expected cost. Through an extensive simulation study, we analyze the quality of our approximation, which on average performed within 0.50% of the lower bound. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 377–398, 2000     

目标宽频带RCS的快速算法研究

目标宽带RCS预估算法一直是计算电磁学的一个研究热点，本文分别研究了渐近波形估计技术（AWE）与最佳一致逼近技术在宽频带RCS预估领域内的应用。首先，介绍了传统矩量法计算RCS的原理，并分析了两种快速算法的计算过程。然后，采用这两种技术，分别计算了简易飞机模型的RCS值，并对这两种方法进行比较。计算结果表明相比传统的矩量法，这两种方法在不影响精度的前提下大大提高了计算效率。同时，相比渐近波形估计技术，最佳一致逼近技术在节省内存，节约时间方面更具优势。最后，采用最佳一致逼近理论，结合电磁计算软件，实现较大尺寸目标的宽频带RCS的计算。     

火炮射表数据处理方法评述

主要介绍火炮射表数据处理方法,对国内目前较为流行的两种射表逼近方法进行了全面、系统的分析与比较,指出了逐步回归射表逼近方法存在的缺陷和不足。对国外近几年采用的插值法文中也进行了比较详细的讨论,并指出了未来的研究问题。     

数据处理的实用方法和算法

通过对正交多项式的构造和逼近准则的研究,得到了一类数据处理问题的一种较理想的逼近准则和算法。理论分析和模拟计算表明,用本文方法处理这类问题有较高的拟合精度并容易计算。     

求解整数规划问题的一个搜索方法

本文整数规划问题给出一种搜索方法,它类似于求解连续变量优化问题的迭代方法,从一个好的初始可行解出发,寻找一个搜索方向,沿着这个方向求出改进的可行解,然后又开始下一次迭代。此方法简单易行,可以求出问题的最优解或近似最优解,对于整数线性规划问题和整数非线性规划问题的求解都适用,并且容易推广到求解大规校整数线性规划问题。文中附有计算例子,说明方法是有效的。     

Approximation methods for the analysis of a multicomponent,multiproduct assemble‐to‐order system

In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011