Minimum projection uniformity for computer experiment with quantitative factors

admin — Sat, 29 Sep 2018 13:48:26 +0000

حداقل یکنواختی طرح ریزی برای آزمایش کامپیوتری با عوامل کمی

Computer experiments involving quantitative factors at high levels are becoming more and more important in the study of complex experiments arising in the area of science and engineering. Uniform designs are found to be widely applicable in computer experiments in the form of space-filling designs. In this paper, the projection uniformity for quantitative designs is studied under wrap-around $L 2 ">$ -discrepancy. A lower bound of uniformity pattern for general asymmetric designs is provided, which can be used to serve as a benchmark for both comparing different designs and also to determine the optimal design. As a byproduct, a lower bound of wrap-around $L 2 ">$ -discrepancy measure for the asymmetric design is also obtained. Some illustrative examples and numerical comparisons are also provided for supporting our theoretical results.

نویسندگان: Tingxun Gou, Hong Qin, Kashinath Chatterjee

ژورنال: Journal of the Korean Statistical Society

سال انتشار: 2018

دانلود مقاله:

https://www.phdyar.ir/wp-content/uploads/2018/09/Minimum-projection-uniformity-for-computer-experiment-with-quantitative-factors.pdf

A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem

admin — Tue, 25 Sep 2018 21:11:46 +0000

الگوریتم Simureistic برای تنظیم زمان شروع در مسئله جریان موازی تصادفی

This paper addresses the parallel flowshop scheduling problem with stochastic processing times, where a product composed of several components has to be finished at a particular moment. These components are processed in independent parallel factories, and each factory can be modeled as a permutation flowshop. The processing time of each operation at each factory is a random variable following a given probability distribution. The aim is to find the robust starting time of the operations at each factory in a way that all the components of the product are completed on a given deadline with a user-defined probability. A simheuristic algorithm is proposed in order to minimize each of the following key performance indicators: (i) the makespan in the deterministic version; and (ii) the expected makespan or a makespan percentile in the stochastic version. A set of computational experiments are carried out to illustrate the performance of the proposed methodology by comparing the outputs under different levels of stochasticity.

نویسندگان: Sara Hatami, Laura Calvet, Victor Fernández-Viagas, José M Framiñán, Angel A.Juan

ژورنال: Simulation Modelling Practice and Theory