Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks.     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

解约束优化问题的QP-free可行域方法

本文利用一个新的分片线性NCP函数提出一个新的可行的QP-free方法解非线性不等式约束优化问题.不同于其他的QP-free方法,这个方法只考虑在工作集中的约束函数,工作集是积极集的一个估计,因此子问题的维数不是满秩的.这个方法可行的并且不需假定严格互补条件、聚点的孤立性得到算法的全局收敛性,并且积极约束函数的梯度不要求线性独立的,其中由拟牛顿法得到的子矩阵不需要求一致正定性.     

混合方次的Waring——Goldbach问题

研究混合方次的Waring--Goldbach     

弱混强平稳序列随机容量、随即秩次序统计量的极限分布律

设W(1n)W2(n)…W(nn)是严平稳随即序列{Xn,n 1}的前几个变量的顺序统计量,Nn Mn是两正整值r.v,n 1.在较弱一些的混合条件下,本文给出了W(NMn)n标准化后的极限分布,从而使一些提法更趋一般化,主要结果推进了Rao(1984)和张国胜(1993)的工作.由于混合条件的减弱,使得对m-相关和正态平稳过程的具体应用讨论更加充分.     

���������������������͵�������

??In this paper, by applying the moment inequality for asymptotically almost negatively associated (AANA, in short) random sequence and truncated method, the equivalent conditions of complete moment convergence of the maximum partial for weighted sums of AANA random variables are obtained without assumptions of identical distribution, which generalize and improve the corresponding ones of{15},{16} and {17}, respectively.     

Asymptotics in the Baum—Katz formula for random fields

In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained.     

THE DIMENSION FOR RANDOM SUB-SELF-SIMILAR SET

In this article,the Hausdorff dimension and exact Hausdorff measure function of any random sub-self-similar set are obtained under some reasonable conditions.Several examples are given at the end.