THE PROBLEM OF ASSIGNING JOBS TO MACHINES WITH SPECIAL REFERENCE TO PARALLEL/IDENTICAL PROCESSORS.
Item
-
Title
-
THE PROBLEM OF ASSIGNING JOBS TO MACHINES WITH SPECIAL REFERENCE TO PARALLEL/IDENTICAL PROCESSORS.
-
Identifier
-
AAI8023685
-
identifier
-
8023685
-
Creator
-
AMAR, AMAR DEV.
-
Contributor
-
Eugen N. Vasilescu
-
Date
-
1980
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Business Administration, General
-
Abstract
-
Providing a comprehensive classification of the production scheduling problem according to six characteristics, this work focuses on solution algorithms to schedule n jobs on M identical machines when the total cost of penalty due to delay has to be minimized. Going over theoretical developments over the last two decades of this problem, a new theoretical basis to define and understand it has been provided. A critique on the performance of the last best algorithm has been made in the framework of four available applicable theorems. Complying with the provided theoretical basis and these four theorems, a new computer based 'exact' algorithm is written and test results on problems borrowed from previous authors of similar algorithms have been reported. This new algorithm had better performance in terms of reduced computer CPU running times. This dissertation has also tested a new lower bound although it did not prove to be better than the best lower bound available in the literature. Experiments on Shortest Processing Time First and Least Penalty First selection rules have been done and approximate algorithms using these selection rules have been tested. Although these algorithms do not provide exact solutions, their CPU running times have been cut down tremendously whereas the worst case encountered here had only 1.825% increased penalty as compared with the optimum.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
-
Program
-
Business
