Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem

Please enable javascript in your browser.

142 viewed

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

1001 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 41561 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Nasser
Abstract:
This research investigates permutation flow shop scheduling problems with sequence-dependent setup times with minimizing the number of tardy jobs as criterion (Fm|prmu, Sijk|ΣUj). A mixed integer linear programming model has been developed for the research problem. As the problem is shown to be NP-hard, several meta-heuristic algorithms based on tabu search (TS) and imperialist competitive algorithm are developed to heuristically solve the problem. In order to find the best meta-heuristic algorithm, random test problems, ranging in size from small, medium, to large are created and solved by the meta-heuristic algorithms. Then, a detailed statistical experiment, based on split-plot design is performed to find the best meta-heuristic algorithm. The results of the experiment show that the hybrid of TS and Imperialist competitive algorithm has the best performance.
Keywords:
Sequencing ; Mathematical Modeling ; Tabu Search Algorithm ; Meta Heuristic Algorithm ; Flow Shop Scheduling ; Minimization Number of Tardy Jobs ; Imperialist Competitive Algorithm

No TOC