The phase field method integrates the Griffith theory and damage mechanics approach to predict crack initiation, propagation, and branching within one framework. No crack tracking topology is needed, and complex crack shapes can be captures without user intervention. In this paper, a detailed description of how the phase field method is implemented with explicit dynamics into LS-DYNA is provide...

background: the brown-banded cockroach, supella longipalpa , is not as common as the german cockroach in iran. this species seeks out areas that are very warm most of the time, and prefer warmer area than what german cock­roaches pre­fer. there is relationship between development of instars and diet of cockroaches. the aim of this study was to determine the effect of different diets on biology,...

Cycle time optimization could be one of the great challenges in business process management. Although there is much research on this subject, task similarities have been paid little attention. In this paper, a new approach is proposed to optimize cycle time by minimizing entropy of work lists in resource allocation while keeping workloads balanced. The idea of the entropy of work lists comes fr...

This study develops an inventory model for determining an optimal ordering policy for non-deteriorating items and time-dependent holding cost with delayed payments permitted by the supplier under inflation and time-discounting. The discounted cash flows approach is applied to study the problem analysis. Mathematical models have been derived under two different situations i.e. case I: The permis...

This paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. We have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. Further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

Cycle multiplicity of a graph G is the maximum number edge disjoint cycles in G. In this paper, we determine cycle and then obtain formula total complete bipartite graph, generalizes result for, which given by M.M. Akbar Ali [1].