SIMULATION OF SCHEDULING PROBLEM IN A JOB - SHOP WITH STOCHASTIC -ARRIVAL AND SERVICE TIMES

Abstract

,scheduling problem arises whenever there is a choice of the order in which jobs can he performed. The rbjective for any scheduling problem is to minimize number of jobs waiting in the system. This can be achieved through optimal scheduling. A schedule can be made in a number of ways depending upon different criteria for the selection of scheduling process. The work presented in this dissertation is a general study and deals with determining a method of scheduling with the criteria of reduction in the number of jobs waiting in the system for all the jobs on all machines with optimum possible completion time and also better system utilization. Computer programs were developed. the program can be used for any production situation, although it was verified for only three machine stochastic job-shop, The simulation technique is used to generate job-characteristics. The algorithm developed was shown to result in maxiiaum improve-ments in waiting of jobs and b4tter system utilization with optimum completion time of all the jobs on all machines