An inventory-transportation system with stochastic demand

We study a logistic system in which a supplier has to deliver a set of products to a set of retailers to face a stochastic demand over a given time horizon. The transportation from the supplier to each retailer can be performed either directly, by expensive and fast vehicles, or through an intermediate depot, by less expensive but slower vehicles. At most one time period is required in the former case, while two time periods are needed in the latter case. A variable transportation cost is charged in the former case, while a fixed transportation cost per journey is charged in the latter case. An inventory cost is charged at the intermediate depot. The problem is to determine, for each time period and for each product, the quantity to send from the supplier to the depot, from the depot to each retailer and from the supplier to each retailer, in order to minimize the total expected cost. We first show that the classical benchmark policy, in which the demand of each product at each retailer is set equal to the average demand, can give a solution which is infinitely worse with respect to the optimal solution. Then, we propose two classes of policies to solve this problem. The first class, referred to as Horizon Policies, is composed of policies which require the solution of the overall problem over the time horizon. The second class, referred to as Reoptimization Policies, is composed of a myopic policy and several rolling-horizon policies in which the problem is reoptimized at each time period, once the demand of the time period is revealed. We evaluate the performance of each policy dynamically, by using Monte Carlo Simulation.     

Resource Allocation with Noise Constraints

In the allocation of resources to activities, each activity is described by a concave return function and the sum of the returns is maximized. There are linear constraints on the available quantity of each essential resource. Existing methods for the incremental generation of almost-optimal allocations and for the evaluation of such allocations are extended to include allocations involving "noise" constraints in addition to the linear constraints on the available quantity of each resource. A noise constraint, which is defined in the paper, may be expressed by any relationship, not necessarily linear. An example is given in which the noise constraints take the form of constraints on additional resources.     

Boolean Algebras with Finite Families of Computable Automorphisms

We prove that each computable Boolean algebra has a computable presentation in which for every computable family of automorphisms the set of atoms moved by at least one of its members is finite. This implies that each computable atomic Boolean algebra has a computable presentation in which its every computable family of automorphisms is finite. The priority argument is not used in the proof.     

A Two Priority Queue with Crossover Feedback

This paper considers the delay distributions in a two-class non-preemptive priority queue with crossover feedback. Specifically, there are two priority classes, and the Poisson arrival process for each class can be subdivided into two groups: one group which only requires service at the priority level to which it arrives, and another group which requires subsequent service after it feeds back to the other queue. Our main result is the determination of explicit expressions for the distribution of delay until final service commences for each the four types of customers.     

具有约束条件的C分类

本文给出了一种在类别数一定且各类中样本数一定的条件下的两种分类方法,它将传统分类方法向类中心聚集改变为向类优向量聚集,使具有此种约束条件的Ｃ分类更加合理。     

An elliptic problem with critical growth in domains with shrinking holes

We study an elliptic problem involving critical Sobolev exponent in domains with small holes. We prove the existence of solutions which blow up like a volcano near the centre of each hole.     

Stability and travelling waves for a time-delayed population system with stage structure

We study a time-delayed population system with stage structure for the interaction between two species, the adult members of which are in competition. For each of the two species the model incorporates a time delay which represents the time from birth to maturity of that species. The global stability results are established for each equilibrium. The criteria for global convergence to each equilibrium are sharp and involve these delays. By using lower and upper travelling wave solutions, we show that the model has travelling wave solutions that connect the origin and the coexistence equilibrium with speeds greater than the spreading speed of each species in the absence of its rival.     

工件具有子工件工期的排序问题

研究了工件具有子工件工期的排序问题.需要在一台单机上加工若干个给定的工件.每个工件由若干个子工件组成,每个子工件都有各自的工期.只有当工件的每个子工件都按时完成,才能称该工件是按时完工工件,否则,称该工件产生延误.目标是最大化按时完工的工件个数.证明当每个工件都被分成两个子工件时,该问题是NP-难的,而且不存在完全多项式时间近似方案(fully polynomial time approximation scheme,简记为FPTAS).提出两个启发式算法,利用数值模拟比较它们的性能,并且将这两个启发式算法的解与最优解的上界进行比较.     

Auctions with interdependent valuations

This paper analyses auctions in which the valuation of each player not only depends on whether he wins or not, but also on who is the winner if it is not him.     

Knot exteriors with all possible meridional essential surfaces

We show the existence of infinitely many knots where each exterior contains meridional essential surfaces of independently unbounded genus and number of boundary components. In particular, we construct examples of knot exteriors each of which has all possible compact orientable surfaces embedded as meridional essential surfaces. From these results, we also prove the existence of a hyperbolic knot exterior, not necessarily of a knot in the 3-sphere, for which there are meridional essential surfaces of simultaneously unbounded genus and number of boundary components.     

公共交货期窗口的提前／延期惩罚

本讨论n个独立工件在一台机器上加工,而且加工时间服从正态分布的公共交货期窗口的提前/延期惩罚问题,在确定公共交货期窗口情况下,推导出工件的最优排序具有V型特征。     

A capacity reservation game for suppliers with multiple blocks of capacity

This paper studies a supplier competition model in which a buyer reserves capacity from a number of suppliers that each have multiple blocks of capacity (e.g., production or power plants). The suppliers each submit a bid that specifies a reservation price and an execution price for every block, and the buyer determines what blocks to reserve. This game involves both external competition between suppliers and internal competition between blocks from each supplier. We characterize the properties of pure-strategy Nash equilibria for the game. Such equilibria may not always exist, and we provide the conditions under which they do.     

Contracting with demand uncertainty under supply chain competition

We examine supply chain contracts for two competing supply chains selling a substitutable product, each consisting of one manufacturer and one retailer. Both manufacturers are Stackelberg leaders and the retailers are followers. Manufacturers in two competing supply chains may choose different contracts, either a wholesale price contract in which the retailer??s demand forecasting information is not shared, or a revenue-sharing contract in which the retailer??s demand forecasting information is shared. Under supply chain competition and demand uncertainty, we identify which contract is more advantageous for each supply chain, and under what circumstances.     

具有固定得分向量的竞赛矩阵的数目

本文考虑以允许平局的单循环比赛为模型的竞赛图（二重完全图）的定向图的邻接矩阵（竞赛矩阵）．给出了具有特殊得分向量的竞赛矩阵的数目,得到了具有ｎ阶强有效得分向量的竞赛矩阵的数目的下确界,并给出了达到此下界的得分向量的刻划．     

岭回归在石油钻井工程中的应用

在石油钻井工程中，井壁坍塌的状况即井径的扩大与缩小，与地层中泥页岩的各种理化性质有关，而这些理化参数又存在于一定程度的相关性．本文利用岭回归分析数据进行了分析与处理，建立了井径扩大的数学模型，确定了影响井径的主要理化指标，为倾决井壁坍塌提供了理论依据．     

Many Sources Asymptotics for Networks with Small Buffers

In this paper, we obtain the overflow asymptotics in a network with small buffers when the resources are accessed by a large number of stationary independent sources. Under the assumption that the network is loop-free with respect to source–destination routes, we identify the precise large deviations rate functions for the buffer overflow at each node in terms of the external input characteristics. It is assumed that each type of source requires a Quality of Service (QoS) defined by bounds on the fraction of offered work lost. We then obtain the admissible region for sources which access the network based on these QoS requirements. When all the sources require the same QoS, we show that the admissible region asymptotically corresponds to that which is obtained by assuming that flows pass through each node unchanged.     

Characterization of best Chebyshev approximations with prescribed norm

In this paper a new characterization of smooth normed linear spaces is discussed using the notion of proximal points of a pair of convex sets. It is proved that a normed linear space is smooth if and only if for each pair of convex sets, points which are mutually nearest to each other from the respective sets are proximal.     

Multi-machine scheduling with deteriorating jobs and scheduled maintenance

In this paper, we investigate a multi-machine scheduling problem in which job processing times are increasing functions of their starting times and machines are not always available. Job processing times are assumed to follow simple linear deteriorations. Moreover, each machine is assumed to have a maintenance period which is known in advance. Both the resumable and non-resumable cases are discussed with the objective of minimizing the makespan. A lower bound and a heuristic algorithm are derived for each case. Numerical results are also provided to evaluate the efficiency of the proposed procedures.     

一种不完全信息的多属性决策模型及其灵敏度分析

针对具有区间信任结构的不完全信息的多属性决策问题,建立了一组集结各属性区间信任度的优化模型,得到每个方案属于各个评价等级的总体信任度.在这一优化模型的基础上,建立了计算期望效用值的约束优化模型,通过求解该优化问题,得到各方案的期望效用值,用期望效用值对决策方案进行排序.分析了期望效用值对属性权系数的灵敏度,提出了一种方案排序结果对决策参数的灵敏度分析方法.最后,用算例验证了模型的有效性.     

Three-bridge links with infinitely many three-bridge spheres

We construct infinitely many three-bridge links each of which admits infinitely many three-bridge spheres up to isotopy.