2. Time Sequence
RES
--
|--
Answers
When a number of jobs are given to be done and they require processing on two or more machines, the main concern of a manager is to find the order or sequence to perform these jobs. We shall consider the sequencing problems in respect of the jobs to be performed in a factory and study the method of their solution. Such sequencing problems can be broadly divided in two groups. In the first one, there are n jobs to be done, each of which requires processing on some or all of the k different machines. We can determine the effectiveness of each of the sequences that the technologically feasible (that is to say, those satisfying the restrictions on the order in which each job must be processed through the machines) and choose a sequence which optimizes the effectiveness. To illustrate, the timings of processing of each of the n jobs on each of the k machines, in a certain given order, may be given and the time for performing the jobs may be the measure of effectiveness. We shall select the sequences for which the total time taken in processing all the jobs on the machines would be the minimum.
In this unit we will look into solution of a sequencing problem. In this lesson the solutions of following cases will be discussed:
a) n jobs and two machines A and B, all jobs processed in the order AB.
b) n jobs and three machines A, B and C all jobs processed in the order ABC
c) Problems with n jobs and m machines.