In the past few years, several tools for the automation of the analog integrated circuit (IC) cell and system layout design, with application on both new and reused designs have emerged. Yet, most of the layout design is still handmade, essentially because analog designers want to have total control over the different design options, and also, due to the fact that current fully automated genera...

OBJECTIVE Stem cell therapy can be an efficacious treatment option for bone fragility disorders (eg, osteogenesis imperfecta, disuse osteopenia, and osteoporosis), and successful cell therapy application may be dependent on optimal cell engraftment in target bones. The objective of this study was to compare the efficiency of intra-medullar and intra-venous delivery of mesenchymal stem cells (MS...

a facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. an efficient layout contributes to the overall efficiency of operations. it’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. consequently, the efficiency of the current layout decreases or is lost and it ...

This paper presents a new mathematical model for integrated dynamic cellular manufacturing systems and production planning that minimizes machine purchasing, intra-cell material handling, cell reconfiguration and setup costs. The presented model forms the manufacturing cells and determines the quantity of machine and movements  during each period of time. This problem is NP-hard, so a meta-heur...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

Let G be a finite group generated by reflections. It is shown that the elements of G can be arranged in a cycle (a "Gray. code") such that each element is obtained from the previous one by applying one of the generators. The case G = d[ ' yields a conventional binary Gray code. These generalized Gray codes provide an efficient wa), to run through the elements of any finite reflection group.