Generalized Tardiness Flow Shop Problem

Please enable javascript in your browser.

Meshkinfam, Sareh | 2014

478 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 45755 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Shavandi, Hassan
Abstract:
In this thesis, several metaheusristic algorithms for solving the generalized tardiness flow shop problem are proposed. In the generalized tardiness flowshop a due date is defined for every operation of the jobs. With the best of our knowledge is the first attempt to develop a genetic algorithm for the proposed problem. Several genetic algorithms are develpoed based on selecting the parents.The proposed GAs are tunned using experimtal analysis and the efficiency of lgorithms are analyzed with many randomly generated problems. Sensitivity analysis is also done to drive mangerial insights
Keywords:
Sequencing ; Genetic Algorithm ; Flow Shop Scheduling ; Generalized Flowshop ; Intermediate Due Date ; Minimum Tardiness

No TOC