Loading...

A No-Wait Flowshop Scheduling Problem with Sequence Dependent Setup Time

Arab Ameri, Sedighe | 2012

430 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 43068 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Salmasi, Nasser
  7. Abstract:
  8. In this research a no-wait flowshop sequence dependent setup time scheduling problem with weighted earliness-tardiness penalties as the criterion (F_m |nwt,S_ijk |∑▒〖w_j^' E_j+w_j^" T_j 〗) is investigated. It is assumed that n jobs are assigned to a flowshop with m machines. The jobs are not allowed to wait between two successive machines according to no-wait requirement. Moreover each machine needs a setup time before processing a new job. The value of this setup time is dependent on the previous processed job on that machine.
    A mixed integer linear programming model is proposed to solve the problem. As the problem is shown to be strongly NP-hard, a particle swarm optimization (PSO) algorithm as well as a tabu search (TS) algorithm are proposed to solve the problem. In PSO algorithm two different neighborhood structures are applied to improve the solution quality of algorithm. Also three different methods and two different neighborhood structures are applied to generate initial solution and neighborhoods respectively in TS algorithm. As the objective function is not a regular one, a timing algorithm is generated to find the optimal schedule and calculate the objective function value of a given sequence in all algorithms.
    In order to compare the performance of algorithms, different classes of test problems based on setup time ratio and the number of jobs are defined and generated randomly for two, three and six machine problems and solved by all algorithms. Computational results show that the PSO algorithm has better performance than the TS algorithm especially for large size problems. Also insert move show better performance than swap move in TS algorithm while random generation of initial solution is not suggested
  9. Keywords:
  10. Sequence Dependent Setup ; Flow Shop Scheduling ; Weighted Earliness/Turdiness ; Particles Swarm Optimization (PSO) ; Tabu Search Algorithm ; No-Wait

 Digital Object List

 Bookmark

No TOC