Group Scheduling on Flow Shop with Sequence Dependent Setup Times and no Wait Assumption

Please enable javascript in your browser.

This page was sent successfuly

Bookmark

709 viewed

زمان بندی جریان کارگاهی گروهی با زمان آماده سازی وابسته به توالی با فرض عدم توقف کارها

709 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 45277 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Naser
Abstract:
The present thesis is focused upon the flow shop sequence dependent group scheduling problem (FSDGS) with no wait assumption. Generally, production sequencing and scheduling is considered as one of the most important factors in productivity and cost saving of organizations. Therefore, determining an appropriate sequencing of groups and jobs according to the logical constraints is expected to improve the performance and productivity of the production system.
In this thesis, due to the importance and multiple applications of this problem, we will consider the FSDGS problem and propose new heuristic and metaheuristic algorithms to tackle this problem. Since the good performance of particle swarm optimization (PSO) algorithm in similar cases has been shown in literature, we developed a metaheuristic algorithm based on this approach. In addition, a variable neighborhood search algorithm (VNS) was developed in order to solve this problem heuristically. Consequently, comparisons were drawn between the performances of these two algorithms. Several constructive heuristic algorithms have been developed in as the initial solution for this problem
Keywords:
Group Scheduling ; Sequence Dependent Setup ; FLOWSHOP ; Particles Swarm Optimization (PSO) ; Variable Neighborhood Search ; Mathematical Modeling ; No-Wait

No TOC