Scribd
Upload
707 views2 pages

Sequencing Problems

The document contains 8 problems involving job sequencing and determining the optimum sequence of jobs across multiple machines to minimize the total elapsed time. The problems provide processing time tables for different jobs on 2-3 machines and ask to find the sequence that minimizes the total time or determines idle times on machines.

Uploaded by

Subramani Lakshmaiha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
707 views2 pages

Sequencing Problems

The document contains 8 problems involving job sequencing and determining the optimum sequence of jobs across multiple machines to minimize the total elapsed time. The problems provide processing time tables for different jobs on 2-3 machines and ask to find the sequence that minimizes the total time or determines idle times on machines.

Uploaded by

Subramani Lakshmaiha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Problems on Sequencing

1. Seven jobs go first over machine 1 and then over machine 2. Processing times in hours are given below: Job Machine 1 Machine 2 : : : A 6 16 B 24 20 C 30 20 D 12 12 E 20 24 F 22 2 G 18 6

2. Find the sequence that minimizes the total elapsed time required to complete the following tasks on two machines: Task Machine A Machine B : : : I 4 12 II 10 16 III 8 14 IV 18 8 V 12 6 VI 16 18 VII 14 6 VIII 10 16 IX 8 22

3. Provide the optimum job sequencing involving three machines M1, M2, M3 in order M1,M2,M3 for the following: Job : J1 J2 J3 J4 J5 Machine 1 : 7 12 11 9 8 Machine 2 : 8 9 5 6 7 Machine 3 : 11 13 9 10 14 4. Six jobs have to be processed at three machines A, B and C in the order ABC. The time taken by each job on each machine is indicated below. Each machine can process only one job at a time: Job A Machin e : : J1 12 J2 8 J3 7 J4 11 J5 10 J6 5

B : 7 10 9 6 10 5 C : 3 4 2 5 1.5 4 5. Given the following data regarding the processing time of some jobs on three machines M1,M2 and M3. The order of processing is M1-M2-M3. Determine the sequence that minimizes the total elapsed time required to complete the following jobs. Also evaluate idle time for M2 and M3. Job : A B C D E F G

M1 M2 M3

: : :

30 40 60

80 30 70

70 20 50

40 50 110

90 10 50

80 40 60

70 30 120

6. Use the graphical method to minimize the time needed to process the following jobs on the machines shown, i,e., for each machine find the job which should be done first. Also calculate the total elapsed time to complete both jobs. (USING GRAPHICAL METHOD) a) Job 1 Machine sequence Time Job 2 b) Job 1 Machine sequence Time Machine sequence Time Job 2 c) Job 1 Job 2 Machine sequence Time Machine sequence Time Machine sequence Time 7. A 3 B 5 A 6 B 10 A 2 C 4 B 4 C 4 B 8 C 8 B 3 A 5 C 2 A 3 C 4 A 6 C 4 D 3 D 6 D 2 D 12 D 4 D 6 E 2 E 2 E 6 E 4 E 12 E 2 B 6

Six jobs are to be processed at three machines A, B and C in the order BAC. The time taken by each job on the three machines is given below. Each machine can process one job at a time. Job A Machin e : : 1 30 2 40 3 20 4 10 5 50 6 35

B : 50 80 90 70 60 75 C : 40 80 70 60 20 45 Determine the optimum sequence for the jobs and total elapsed time. 8.

You might also like