具有交易成本的证券投资组合选择：一种求解方法

本研究一类带交易成本证券投资组合选择的求解，在风险不超过某个阈值的假设下，我们给出一种求解方法，最后本通过实例计算表明该方法是有效的。     

人力资源成本预算与控制的理论分析

本的分析是人力资源成本管理体系研究的一部分，着重于探讨在人力资源成本管理体系中，人力资源成本的预算与控制与该体系中其他几部分之间的关系，研究人力资源成本管理实践中成本预算与控制的理论基础，并提出一些新的思路。     

Resolution approach for multi-objective problems with uncertain demands

The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In a lot of cases, the combination of goals and resource exponentially increases search space. The objective of resolution of such a problem is generally, to maximize the production with a lower cost and makespan. In this paper, we explain how to modify the objective function of genetic algorithms to treat the multi-objective problem and to generate a set of diversified “optimal” solutions in order to help decision maker. We are interested in one of the problems occurring in the production workshops where the list of demands is split into firm (certain) jobs and predicted jobs. One wishes to maximize the produced quantity, while minimizing as well as possible the makespan and the production costs. Genetic algorithms are used to find the scheduling solution of the firm jobs because they are well adapted to the treatment of the multi-objective optimization problems. The predicted jobs will be inserted in the real solutions (given by genetic algorithms). The solutions proposed by our approach are compared to the lower bound of the cost and makespan in order to prove the quality and robustness of our proposed approach.     

A hybrid two-stage transportation and batch scheduling problem

We study the coordinated scheduling problem of hybrid batch production on a single batching machine and two-stage transportation connecting the production, where there is a crane available in the first-stage transportation that transports jobs from the warehouse to the machine and there is a vehicle available in the second-stage transportation to deliver jobs from the machine to the customer. As the job to be carried out is big and heavy in the steel industry, it is reasonable assumed that both the crane and the vehicle have unit capacity. The batching machine processes a batch of jobs simultaneously. Each batch occur a setup cost. The objective is to minimize the sum of the makespan and the total setup cost. We prove that this problem is strongly NP-hard. A polynomial time algorithm is proposed for a case where the job transportation times are identical on the crane or the vehicle. An efficient heuristic algorithm for the general problem is constructed and its tight worst-case bound is analyzed. In order to further verify the performance of the proposed heuristics, we develop a lower bound on the optimal objective function. Computational experiments show that the heuristic algorithm performs well on randomly generated problem instances.     

The significance of reducing setup times/setup costs

Scheduling with setup times or setup costs plays a crucial role in todays modern manufacturing and service environments where reliable products/services are to be delivered on time. Scheduling activities profoundly depend on the times/costs required to prepare the facility for performing the activities. However, the vast majority of existing scheduling literature ignores this fact. We define and emphasize the importance, applications, and benefits of explicitly considering setup times/costs in scheduling research. Moreover, a review of the latest research on scheduling problems with setup times/costs is provided.     

Well-posedness of the spatially homogeneous Landau equation for soft potentials

We consider the spatially homogeneous Landau equation of kinetic theory, and provide a differential inequality for the Wasserstein distance with quadratic cost between two solutions. We deduce some well-posedness results. The main difficulty is that this equation presents a singularity for small relative velocities. Our uniqueness result is the first one in the important case of soft potentials. Furthermore, it is almost optimal for a class of moderately soft potentials, that is for a moderate singularity. Indeed, in such a case, our result applies for initial conditions with finite mass, energy, and entropy. For the other moderately soft potentials, we assume additionally some moment conditions on the initial data. For very soft potentials, we obtain only a local (in time) well-posedness result, under some integrability conditions. Our proof is probabilistic, and uses a stochastic version of the Landau equation, in the spirit of Tanaka [H. Tanaka, Probabilistic treatment of the Boltzmann equation of Maxwellian molecules, Z. Wahrsch. Verw. Geb. 46 (1) (1978-1979) 67-105].     

Decentralized Guaranteed Cost Control for Uncertain Large-Scale Systems Using Delayed Feedback: LMI Optimization Approach

In this paper, we propose a design method of guaranteed cost controllers for uncertain large-scale systems with time delays in subsystem interconnections using delayed feedback. Using the Lyapunov method, a linear matrix inequality (LMI) optimization problem is formulated to design a delayed feedback controller which minimizes the upper bound of a given quadratic cost function. A numerical example is included to illustrate the design procedures.Communicated by Q. C. ZhaoThe authors thank the Associate Editor and three anonymous referees for careful reading and useful suggestions.     

On the optimality equation for average cost Markov control processes with Feller transition probabilities

We consider Markov control processes with Borel state space and Feller transition probabilities, satisfying some generalized geometric ergodicity conditions. We provide a new theorem on the existence of a solution to the average cost optimality equation.     

A multi-objective wholesaler–retailers inventory-distribution model with controllable lead-time based on probabilistic fuzzy set and triangular fuzzy number

This paper develops a single wholesaler and multi retailers mixture inventory distribution model for a single item involving controllable lead-time with backorder and lost sales. The retailers purchase their items from the wholesaler in lots at some intervals throughout the year to meet the customers’ demand. Not to loose the demands, the retailers offer a price discount to the customers on the stock-out items. Here, it is assumed that the lead-time demands of retailers are uncertain in both stochastic and fuzzy sense, i.e., these are simultaneously random and imprecise. To implement this behavior of the lead-time demands, at first, these demands are assumed to be random, say following a normal distribution. With these random demands, the expected total cost for each retailer is obtained. Now, the mean lead-time demands (which are crisp ones) of the retailers are fuzzified. This fuzzy nature of the lead-time demands implies that the annual average demands of the retailers must be fuzzy numbers, suppose these are triangular fuzzy numbers. Using signed distance technique for defuzzification, the estimate of total costs for each retailer is derived. Therefore, the problem is reduced to optimize the crisp annual costs of wholesaler and retailers separately. The multi-objective model is solved using Global Criteria method. Numerical illustrations have been made with the help of an example taking two retailers into consideration. Mathematical analyses have been made for global pareto-optimal solutions of the multi-objective optimization problem. Sensitivity analyses have been made on backorder ratio and pareto-optimal solutions for wholesaler and different retailers are compared graphically.     

量子纠缠消相干对确定型远程制备的影响

研究了两种典型的量子纠缠消相干现象对确定型量子态远程制备方案的影响.首先对该确定型远程制备方案进行了分析,得到该方案确定性和比特消耗情况; 然后通过分析制备过程中纠缠消相干现象对系统的影响得出: 在极化消相干过程中,该系统保真度与目标量子比特在Bloch球上的经度选择无关,仅与目标比特的纬度和消相干的大小有关;在相位消相干中,该系统的保真度不会受到消相干的影响,仅与目标量子态的纬度相关. 关键词： 远程制备 纠缠消相干 通信消耗 保真度