Loading...

Optimizing a Flowshop Model with the Objective of Minimizing Total Weighted Tardiness while Considering due Dates on All Machines

Nadimi, Fattane | 2010

636 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 40929 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Ghassemi Tari, Farhad
  7. Abstract:
  8. Minimizing completion time of tasks in a flowshops has always attracted attention of researchers since it was introduced by Johnson, 1954. If all jobs are processed in the same order, the sequence is called a permutation sequence. Tardiness factor is one of important factors in permutation flowshop sequencing problem. Minimizing this factor brings about increase in service level of the shop and is helpful in meeting customer’s needs. Since, minimizing tardiness in PFSP in among NP-hard problems, computational efforts in this area has focused on heuristic approaches. However, the researches has always considered due dates only on the last machine. It means, always it has been assumed that due dates on intermediate machines has no limitation and can be considered as infinite. But, in reality, in many occasions, tasks are needed to be performed and delivered in different stages of their process. In this research, it is assumed that each operation on each machine has a due date and delays bring about penalties. This problem is called general tardiness permutation flowshop sequencing problem (GTPFSP). In this research, it is tried to solve the problem efficiently using a heuristic method.
  9. Keywords:
  10. Genetic Algorithm ; Heuristic Method ; Weighted Tardiness ; General Tardiness Permutation Flowshop Sequencing Problem (GTPFSP)

 Digital Object List

  • محتواي پايان نامه
  •   view

 Bookmark