Abstract

Agile manufacturing is concerned with thriving in prevailing market conditions by quickly introducing new or modified products. This research deals with the scheduling of an agile manufacturing system (AMS), which performs both machining and assembly, with the objective of minimizing the makespan. The AMS allows the production of high varieties of modular products in small batches and at low costs. This problem is difficult to solve optimally and was solved in literature by heuristic algorithms. In the current research, four novel, genetic algorithms and simulated annealing-based, heuristics – General Genetic Algorithm, General Simulated Annealing, Heuristic Assisted Genetic Algorithm, and Heuristic Assisted Simulated Annealing – are developed to address this scheduling problem. A 23 factorial experiment, replicated twice, is conducted to compare the performance of the proposed and existing heuristics and identify the significant factors that affect the resulting percentage deviation from the lower bound and the frequency of resulting in the best solution. The results show the superiority of the developed heuristics to those existing in literature in addition to identifying the significant factors and interactions.

School

School of Sciences and Engineering

Department

Mechanical Engineering Department

Degree Name

MS in Mechanical Engineering

Date of Award

6-1-2004

Online Submission Date

2-12-2013

First Advisor

Lotfi K. Gaafar

Committee Member 1

Hamdy S. Elwany

Committee Member 2

Adel Shalaby

Committee Member 3

Maher Y.A. Younan

Document Type

Thesis

Extent

143 p

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

IRB

Not necessary for this item

Call Number

Thesis 2003/53

Location

mgfth

Download

Share

COinS