A cellular manufacturing system is a structure based on the concept of group technology. The major advantages of this system include the low material handling costs, the short setup and production time.
This study addresses the scheduling problems with exceptional elements .However, before treating a cell scheduling problem, we must solve the problem of optimal routing selection and cell grouping problems.
The problem of optimal routing selection consists in determining the best routing while minimizing the cost of production and respecting constraints on production capacity, the alternative processes of production, as well as the availability and capacity of machines.
The binary cell grouping problem can be classified into combinatorial optimization problems of class NP-hard which cannot be solved in polynomial time. In this study, we propose two algorithms to solve this problem, the first approach is the simulated annealing algorithm, and the second is an extended great deluge algorithm.
The group scheduling problem has also proven to be a combinatorial optimization problems of class NP-hard. In addition, because of the limited time available for making decisions, the computational efficiency is more critical. To this end, an extended great deluge approach is applied to determine the optimal sequence of parts in each cell minimizing the makespan and the total flowtime, and after that a heuristic method is applied to introduce the exceptional elements.
| Date | 13 Jan 2011 |
|---|
| Original language | French |
|---|
| Awarding Institution | - École de technologie supérieure
|
|---|
| Supervisor | Thien-My Dao (Supervisor) |
|---|
Ben Mosbah, A. (Author),
Dao (Supervisor),
13 Jan 2011Student thesis: Master's thesis › Master in Engineering: Mechanical Engineering