Loading...

Weighted Earliness/Tardiness Minimization in a Flow Shop Sequence-Dependent Group Scheduling

Farshadi Panah, Vahid | 2010

824 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 40439 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Salmasi, Naser
  7. Abstract:
  8. In this research, a scheduling problem, minimizing the sum of weighted earliness/tardiness in a flow shop sequence-dependent group scheduling (FSDGS) problem, is investigated. In this problem, every job has a distinct due date, early penalty rate, and tardy penalty rate. This problem is typically classified in the literature as F_m | fmls,S_plk,prmu | ∑(w_j^1 E_j+ w_j^2 T_j). A mixed integer linear programming model is developed for the proposed research problem. As the problem is proved to be strongly NP-hard, only small-size problems can be solved with the mathematical model. Thus, a metaheuristic algorithm based on the Particles Swarm Optimization (PSO) algorithm is developed to solve the industry size problems heuristically. Since the PSO algorithm has been introduced for the continuous solution space, a new method based on the Smallest Position Value (SPV) method, presented in the literature, is proposed. Using this new method, called Revised SPV (RSPV), a new Discrete PSO (DPSO) algorithm is constructed. The suggested DPSO should determine the start time of processing each job on each machine in order to calculate the objective function for a sequence of groups and jobs. For this reason, a new timing algorithm is developed. In order to intensify the DPSO algorithm, a local search method and a maturation strategy is embedded in it. Finally, the experimental comparison shows the performance of intensified DPSO algorithm is evidently better than the first one
  9. Keywords:
  10. Group Scheduling ; Discrete Particle Swarm Optimization (PSO)Algorithm ; Sequence Dependent Setup ; Weighted Earliness/Turdiness ; Flow Shop Scheduling

 Digital Object List

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

 Bookmark

No TOC