Browsing by Subject "Group technology"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
Item Open Access Analysis of Lagrangian lower bounds for a graph partitioning problem(Institute for Operations Research and the Management Sciences (INFORMS), 1999) Adil, G. K.; Ghosh, J. B.Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations to obtain both heuristic solutions and lower bounds on optimal solution values. In this note, we point to certain inconsistencies in the reported results. Among other things, we show analytically that the first bound proposed is trivial (i.e., it can never have a value greater than zero) while the second is also trivial for certain sparse graphs. We also present limited empirical results on the behavior of this second bound as a function of graph density.Item Open Access Cellular manufacturing system design using a holonistic approach(Taylor & Francis, 2000) Aktürk, M. S.; Türkcan, A.We propose an integrated algorithm that will solve the part-family and machine-cell formation problem by simultaneously considering the within-cell layout problem. To the best of our knowledge, this is the first study that considers the efficiency of both individual cells and the overall system in monetary terms. Each cell should make at least a certain amount of profit to attain self-sufficiency, while we maximize the total profit of the system using a holonistic approach. The proposed algorithm provides two alternative solutions; one with independent cells and the other one with inter-cell movement. Our computational experiments indicate that the results are very encouraging for a set of randomly generated problems.Item Open Access Dynamic lot sizing and scheduling in cellular manufacturing systems using hybrid simulation analytic model(International Journal of Industrial Engineering, 1995) Aktürk, M. S.; Dağlıoğlugil, O.In most of the production systems, lot-sizing and scheduling decisions are made at different levels of hierarchy; although there is a strong interaction between these decisions. Furthermore, most of the existing models do not utilize the shop floor conditions in lot-sizing and scheduling decisions, even though such a decision might improve the system performance. In this study, a dynamic lot-sizing and scheduling algorithm is suggested for cellular manufacturing systems, which utilizes a hybrid simulation/analytic modeling approach. The performance of the proposed algorithm is tested against the push and pull systems under different shop floor conditions, and shown that we can improve tardiness, flow time and makespan criteria when comparedto other systems.Item Open Access A hierarchical model for the cell loading problem of cellular manufacturing systems(Taylor & Francis, 1998) Aktürk, M. S.; Wilson, G. R.A hierarchical cell loading approach is proposed to solve the production planning problem in cellular manufacturing systems. Our aim is to minimize the variable cost of production subject to production and inventory balance constraints for families and items, and capacity feasibility constraints for group technology cells and resources over the planning horizon. The computational results indicated that the proposed algorithm was very efficient in finding an optimum solution for a set of randomly generated problems.Item Open Access A multi-family dynamic lot sizing problem with coordinated replenishments: a heuristic procedure(Taylor & Francis, 1993) Mercan, H. M.; Erenguc, S. S.Consider a manufacturing environment where multiple items are produced. These products are grouped into families due to their similarities in design and manufacturing. It pays off to coordinate the manufacture of products in a given family because preparing the facility for producing a family of products involves a major family setup. In addition each individual product in a given family may require a relatively minor setup. The objective is to determine the product lot sizes, over a finite planning horizon, that will minimize the total relevant cost, subject to demand and capacity constraints. In this paper we present an effective heuristic procedure for this problem. Computational results for the heuristic procedure are also reported. Our computational experience leads us to conclude that the heuristic procedure may be of considerable value as a decision making aid to production planners in a real-world setting.