Loading...

Meta-Heuristic Algorithm for Minimization of Total Tardiness in Flexible Flow Shop Scheduling Problems

Gharehbaghi, Alireza | 2013

607 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: English
  3. Document No: 52483 (51)
  4. University: Sharif University of Technology, International Campus, Kish Island
  5. Department: Science and Engineering
  6. Advisor(s): Salmasi, Nasser; Shavandi, Hassan; Najafi, Amir Abbas
  7. Abstract:
  8. This study deals with the heuristic solution of flexible flow shop scheduling problems with unrelated parallel machines. No preemption of jobs is allowed. As an objective function, this paper considers the minimization of total tardiness. As a first step to propose solution, two different mixed integer mathematical models are developed which tackle the problem at hand. The problem is NP-hard and thus the developed mathematical program can only solve problem instances for small sizes in a reasonable amount of time. The next step is to build heuristics which can provide feasible solutions in polynomial time for larger problem instances. Then in the study develops a constructive heuristic for minimization of total tardiness in flexible flow shop environment to solve big industrial problems. By using this heuristic, the first stage sequence is generated. This sequence will then be used, to construct a schedule for the overall problem.The final solution is then the best schedule obtained output of the heuristic. Furthermore, tabu search as one iterative heuristics is proposed to increase the quality of the constructive solution. Detailed computational results are presented to evaluate the efficiency of the heuristic algorithms
  9. Keywords:
  10. Scheduling ; Meta Heuristic Algorithm ; Flexible Flow Shop ; Minimization ; Sequencing ; Tabu Search Algorithm

 Digital Object List

 Bookmark

No TOC