The assembly line balancing problem is a non deterministic polynomial type planning problem for mass production. Layout design changes constitute a major decision that yields investment for assembly operations and numerous heuristics have been reported in the literature for solving the line balancing problems. U-shaped assembly layout offers several benefits over traditional straight-line layou...

Printed circuit boards (PCBs) are extensively used in diverse electronic products today. The placement process is generally the bottleneck in a PCB assembly line. Many researchers have indicated that an optimal component placement sequence reduces the cycle time of an assembly line with single placement machines. However, in current PCB assembly lines, more than one placement machine, including...

the product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. the assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. the first phase determ...

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 hypernite time line H,...