| Author | Cenna, Ahmed Abu |
| Call Number | AIT Thesis no.IE-90-6 |
| Subject(s) | Scheduling (Management)
|
| Note | A thesis submitted in partial fulfillment of requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | This study considers a problem regarding bicriterion scheduling with parallel machines. An
algorithm for this purpose is developed and the program to handle this algorithm is written in
FORTRAN and the program is run on UNIX system. All the parameters of this type of problem is
deterministic in nature. Two aspects of this type of problem are i) Bicriterion Scheduling and ii)
machines are working parallel. This study introduces these two aspects together for the first time.
The two criterion so far considered are i) minimizing total flowtime (measure of inventory) and ii)
minimizing the maximum tardiness (measure of customer service).
Five different dispatching rules has been compared. They are 1) Shortest Processing Time
(SPT-rule) 2) Earliest Due Date (EDD-rule) 3) Minimum Slack Time (MST-rule) 4) Largest Processing Time (LPT-rule) and 5) sequence given by the algorithm of Wassenhove and Gelders.
Wassenhove and Gelders algorithm gives the best result among the dispatching rules.
Finally the developed algorithm has been applied to a real life situation to illustrate and justify the validity of the methodology. With the result of this study recommendations are made for
this factory towards the implementation of the model. |
| Year | 1990 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Tabucanon, Mario T.
|
| Examination Committee(s) | Vrat, Prem ;Nagarur, Nagendra N. |
| Scholarship Donor(s) | The Government of Belgium |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1990 |