Abstract

The problem addressed in this research is the scheduling of an agile manufacturing system comprised of machining and assembly operations with the objective of minimizing the makespan. This problem has been addressed in the literature using heuristics and metaheuristics. In addition, a lower bound has been developed. This research builds upon the findings of the recent literature and proposes two enhanced algorithms, parallel simulated annealing and parallel modified simulated annealing, to solve the addressed problem. The performance of the developed algorithms is compared to that of another simulated annealing algorithm that is available in the literature. Performance comparisons are based on the deviation above the lower bound and the frequency of achieving the best solution amongst all algorithms. The statistical paired t-test and a 2 cubed designed factorial experiment are utilized in these comparisons. The results demonstrate that the two algorithms developed outperform the existing SA algorithms. Factors affecting the performance of all algorithms are also investigated.

School

School of Sciences and Engineering

Department

Interdisciplinary Engineering Program

Date of Award

2-1-2006

Online Submission Date

1-1-2005

First Advisor

Lotfi K. Gaafar

Committee Member 1

Nashaat Fors

Committee Member 2

Abdelghani Elimam

Committee Member 3

Emad Imam

Document Type

Thesis

Extent

113 leaves

Library of Congress Subject Heading 1

Simulated annealing (Mathematics)

Library of Congress Subject Heading 2

Simulation methods.

Rights

The American University in Cairo grants authors of theses and dissertations a maximum embargo period of two years from the date of submission, upon request. After the embargo elapses, these documents are made available publicly. If you are the author of this thesis or dissertation, and would like to request an exceptional extension of the embargo period, please write to thesisadmin@aucegypt.edu

Call Number

Thesis 2005/63

Location

mgfth

Download

Share

COinS