Loading...

Flexible Job Shop Scheduling with Sequence Dependent Setup Times

Kahne, Abdollah | 2011

651 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 42456 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Salmasi, Naser
  7. Abstract:
  8. Due to increasing competition, Flexible Manufacturing System (FMS) take more attention in the new world. This flexibility is generally considered to fall into two categories, which both contain numerous subcategories. The first category, machine flexibility, covers the system's ability to be changed to produce new product types, and ability to change the order of operations executed on a part. The second category is called routing flexibility. Due to high variation in parts and low production volume, setup times are important. In this research, Flexible Jobshop Scheduling Problem with Sequence Dependent Setup Time (SDST-FJSP), as an extension of classical Jobshop scheduling problem (JSP), is considered. JSP is one of the hardest combinatorial optimization that was proved to be NP-Hard. As first, a mixed integer linear programming model is developed for SDST-FJSP. Algorithms base on tabu search and imperialist competition algorithm are presented. As a contribution for this research, two new neighborhoods, base on disjunctive graph, are introduced for SDST-JSP and SDST-FJSP. Some samples are generated. Numerical results indicate high quality solutions
  9. Keywords:
  10. Tabu Search Algorithm ; Sequence Dependent Setup ; Imperialist Competitive Algorithm ; Flow Shop Scheduling ; Flexible Jobshop Scheduling (FJSP) ; Disjunctive Graph

 Digital Object List

 Bookmark

No TOC