Balancing assembly lines, a family of optimization problems commonly known as Assembly Line Balancing Problem, is notoriously NP-Hard. They comprise a set of problems of enormous practical interest to manufacturing industry due to the relevant frequency of this type of production paradigm. For this reason, many researchers on Computational Intelligence and Industrial Engineering have been conce...

In an !1{saturated nonstandard universe a cut is an initial segment of the hyperintegers, which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U , a corresponding U{topology on the hyperintegers by letting O be U open if for any x 2 O there is a y greater than all the elements in U such that the interval [x y; x+y] O. Let U be a cut in a hyper nite time lineH,...

We propose a mechanism for the spontaneous (gauge-invariant) reduction of noncommutative U(n) gauge theories down to SU(n). This can be achieved through the condensation of composite U(n) gauge invariant fields that involves half-infinite Wilson lines in trace-U(1) noninvariant and SU(n) preserving direction. Based on this mechanism we discuss anomalyfree fully gauge invariant noncommutative St...

This paper proposes a biologically inspired ‘molecular assembly line’ — an externally programmable polymeric chain along which molecules are shuttled between chain sites along an arbitrary pathway. Our hope is to construct a scaffold that mimics biological enzymes known as polyketide synthases in their ability to physically hand-off molecules between assembly sites or domains, thereby making al...