No-wait Open-Shop Scheduling Problem with Sequence Dependent Setups and Release Dates

Please enable javascript in your browser.

Khorramfar, Rahman | 2016

694 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 48961 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Naser
Abstract:
This paper deals with no-wait open shop scheduling with sequence dependent setup times and release dates, minimizing total completion times. In spite of practibility of the problem, there is no substantial work dealing the problem. We present three formulation of the problem based on different decision variable paradigms and investigate some computational and efficacy aspects of the models. For large size problems, we first propose a novel encoding and decoding scheme of and present four particle Swarm Optimization (PSO)-based algorithms and four Tabu Search (TS)-base algorithms. To evaluate the performance of the algorithms we carry out two cpmputational experiments; in the first experiment the general performance of the algorithms in small-sized instance compared with optimal solution obtained by mathematical models. The second experiment include evaluating performance of PSO-based algorithm and TS-based algorithm separately and then comparing the winner algorithm. The results indicate that one of the TS-based algorithms slightly outperforms the others
Keywords:
Meta Heuristic Algorithm ; Open Shop ; Sequence Dependent Setup ; Release Data ; No-Wait ; Optimization Method

No TOC