OPTIMAL DUE-DATE DETERMINATION AND SCHEDULING OF N-JOBS IN SEQUENCING PROBLEM

Abstract

Sequencing is the assortment of an appropriate order in which a number of jobs can be assigned to a number of service facilities (machines) so as to optimize the output in terms of time, cost or profit. This thesis considers scheduling of n-jobs on a three machine sequencing problem with due-date assignment, and the completion time of jobs occur on the last machine. In this thesis work, we determine the optimal value of the processing time multiple, assign due-dates to jobs and obtain optimal Sequence to minimize lateness cost function in the case of n-jobs, 3- machine sequencing problem in which processing times on machines satisfy the defined conditions. A theorem has been established and proved that sum of squared value of lateness is minimized by arranging the job’s processing on the first machine as per S.P.T. rule and accordingly due-dates are arranged as per E.D.D. rule. An algorithm has been developed and the work has been supported by numerical example.