Loading...

Minimizing the Weighted Tardiness of Jobs in a Flowshop Sequence-Dependent Set-up Times Scheduling

Afzali Baghdadabadi, Rana | 2010

719 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 40664 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Ghassemi, Farhad
  7. Abstract:
  8. This research considers the permutation flowshop scheduling problem with sequence‐dependent set‐up times .In this model, every job has a distinct due date and a tardy penalty rate. A mathematical model is developed for the proposed problem. As it has been proved to be strongly NP‐hard, only small‐size problems can be solved with the mathematical approaches. Thus, a meta heuristic algorithm based on the Particles Swarm Optimization (PSO) algorithm is developed to solve the real size problems. Particle swarm optimization (PSO) has been developing rapidly and has been applied, as it is easily understood and realized. Since the PSO algorithm has been introduced for the continuous solution space, two methods of converting domain to discrete domain are proposed. One method is based on the Smallest Position Value (SPV) method, and the other one uses the crossover operator in updating the generation to solve the model (PSOC). To obtain better results,the latter algorithm is extended by using two segment crossover.(PSO‐C2).The experimental comparison has conducted and has shown that the performance of algorithms depends on the size of problems. PSO‐C2 is evidently better than the PSO‐C1
  9. Keywords:
  10. Flow Shop Scheduling ; Particles Swarm Optimization (PSO) ; Sequence Dependent Setup ; Weighted Earliness/Turdiness ; Cross Over Operator ; Smallest Value Position

 Digital Object List

 Bookmark

  • safhe aval
  • thesis
  • final3
  • safhe akhar