geleta tadele | Addis Ababa University (original) (raw)
Uploads
Papers by geleta tadele
Because of flow shop scheduling is one of the most important problems in the area of production m... more Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.
In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling probl... more In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling problems in order to handle variety of data type than Geleta [3]. In other hands, as in Geleta [3] it main objective is how to obtain optimal sequence of jobs with aim of minimum squared value of lateness.
Thesis Chapters by geleta tadele
Most of real world decision making problems have multiple objectives, which cannot be optimized s... more Most of real world decision making problems have multiple objectives, which cannot be optimized simultaneously due to the conflicting nature of the objectives. Such problems can be solved by various methods to obtain the best-compromise solutions. Modified Sequential Linear Goal Programming (MSLGP) method can be used to solve Multiple Objective Linear programming Problems. In this paper, the use of existing single objective Linear Programming (LP) techniques is there, and the information required for MSLGP in each iteration are taken from the previous iteration. In this study, there is a great Revised Multi-phase Simplex Algorithm, which is used to solve MSLGP Accordingly within small number of computations as much as possible. This method is illustrated by some numerical examples, and provides 'best compromise' solution.
Because of flow shop scheduling is one of the most important problems in the area of production m... more Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.
In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling probl... more In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling problems in order to handle variety of data type than Geleta [3]. In other hands, as in Geleta [3] it main objective is how to obtain optimal sequence of jobs with aim of minimum squared value of lateness.
Most of real world decision making problems have multiple objectives, which cannot be optimized s... more Most of real world decision making problems have multiple objectives, which cannot be optimized simultaneously due to the conflicting nature of the objectives. Such problems can be solved by various methods to obtain the best-compromise solutions. Modified Sequential Linear Goal Programming (MSLGP) method can be used to solve Multiple Objective Linear programming Problems. In this paper, the use of existing single objective Linear Programming (LP) techniques is there, and the information required for MSLGP in each iteration are taken from the previous iteration. In this study, there is a great Revised Multi-phase Simplex Algorithm, which is used to solve MSLGP Accordingly within small number of computations as much as possible. This method is illustrated by some numerical examples, and provides 'best compromise' solution.