Date Available
12-7-2011
Year of Publication
2009
Degree Name
Master of Science in Manufacturing Systems Engineering (MSMSE)
Document Type
Thesis
College
Engineering
Department
Manufacturing Systems Engineering
First Advisor
Dr. Fazleena Badurdeen
Abstract
Effective production scheduling is essential for improved performance. Scheduling strategies for various shop configurations and performance criteria have been widely studied. Scheduling in parallel machines (PM) is one among the many scheduling problems that has received considerable attention in the literature. An even more complex scheduling problem arises when there are several PM families and jobs are capable of being processed in more than one such family. This research addresses such a situation, which is defined as an Associative Parallel Machine scheduling (APMS) problem. This research presents the SAPT-II algorithm that solves a highly constrained APMS problem with the objective to minimize average flow time. A case example from a make-to-order industrial product manufacturer is used to illustrate the complexity of the problem and evaluate the effectiveness of the scheduling algorithm.
Recommended Citation
Shuaib, Mohannad Abdelrahman, "AN ALGORITHM TO SOLVE THE ASSOCIATIVE PARALLEL MACHINE SCHEDULING PROBLEM" (2009). University of Kentucky Master's Theses. 612.
https://uknowledge.uky.edu/gradschool_theses/612
