Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 44914 (01)
- University: Sharif University of Technology
- Department: Industrial Engineering
- Advisor(s): Modarres Yazdi, Mohammad
- Abstract:
- Location-allocation problem is known as one of the classical problems in industrial engineering. The goals of these problems are finding optimal location of facilities and assigning these facilities to service demands from a given set of point. Location-allocation decisions are widespread through all organization in the world concerning private and public businesses. Therefore, in this study, a practical mathematical model is formulated and solved.In this paper we present a new approach for a budgeted constraint capacitated location-allocation problem integrated with cellular layout approach containing cell formation and group scheduling. Main decisions are composed of formation of facilities, grouping specialized machine types in each facility and the allocation of demands to facilities. This is also concerned with group scheduling of demand on machines inside facilities.In non-deterministic problems, it is assumed that some parameters are uncertain. Robust optimization is an efficient way to deal with uncertainty, especially where distribution of random parameter are unknown. In this problem, it is assumed that required investment for facilities is uncertain. Thus we propose a robust optimization framework and consider interval and budgeted data uncertainty. As this problem is NP-hard, a hybrid algorithm composed of simulated annealing and benders decomposition is developed to solve large scale instance and computational experiment is presented to examine the effectiveness of the algorithm
- Keywords:
- Facility location-Allocation Problem ; Cell Layout ; Robust Optimization ; Meta Heuristic Algorithm ; Mixed Integer Programming
Digital Object List-
محتواي کتاب - view
Bookmark