Scribd
Upload
43 views1 page

Sequencing Tutorial

There are 6 jobs to be processed on 2 machines in the order M1 M2. Determine the sequence of these jobs that minimizes the total elapsed time. Also determine the idle time for each machine.

Uploaded by

Rishabh Gupta
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
43 views1 page

Sequencing Tutorial

There are 6 jobs to be processed on 2 machines in the order M1 M2. Determine the sequence of these jobs that minimizes the total elapsed time. Also determine the idle time for each machine.

Uploaded by

Rishabh Gupta
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/ 1

TUTORIAL 6 1) There are 6 jobs to be processed on 2 machines M1 and M2 in the order M1 M2.

The Processing times in hours are


given below. Determine the sequence of these jobs that minimizes the total elapsed time. Also determine the idle time for each machine. Job 1 2 3 4 5 6 Machine M1 4 10 16 10 12 9 Machine M2 8 9 8 6 12 2 Find the optimal sequence in each of the following cases. Table gives the processing times in each case. Also calculate idle times for each machine. a) Job 1 2 3 4 5 d) Job 1 2 3 4 5 6 Machine M1 4 5 4 9 6 M1 2 6 9 3 2 4 Machine M2 5 4 1 7 4 M2 10 8 10 7 9 12 b) Job Machine M1 Machine M2 c) 1 2 6 2 3 2 1 1 4 3 4 4 2 5 4 4 15 10 3 2 2 5 3 6 4 4 2 6 6 9 5 2 4 7 10 15 6 4 3 8 15 3 7 4 5 9 2 1 10 8 0

2)

Job Machine M1 Machine M2

3) a)

Solve the following sequencing problems by converting into a two fictitious machine problem. Find total elapsed time, and idle times for machine. Job Machine M1 Machine M2 Machine M3 Machine M4 Machine M5 Machine M6 Job Machine M1 Machine M2 Machine M3 Machine M4 1 3 4 10 3 7 6 1 1 2 1 10 2 7 5 8 2 8 4 2 2 3 6 15 3 8 7 5 8 6 2 3 5 6 3 12 4 10 15 6 7 5 1 4 4 7 8 9 5 1 1 5 11 b) Job Machine M1 Machine M2 Machine M3 Machine M4 1 14 9 8 15 2 13 7 9 20 3 10 8 6 16 4 9 6 7 16

c)

d)

Job Machine M1 Machine M2 Machine M3 Machine M4

1 9 5 18 16

2 25 3 6 11

3 5 10 2 15

4 20 15 10 3

5 2 10 5 15

4)

Solve all the problems in question 3 by heuristic procedure.

Ans. : 1. (1, 5, 2, 3, 4, 6), 63 hrs, 2 hrs, 18 hrs, (b) (1, 5, 3, 6, 7, 4, 8, 2, 9, 10), 69 hrs., 0 hr., 13 hrs. (d) (5, 1, 4, 6, 2, 3), 58 hrs., 32 hrs., 2 hrs. ; 2. (a) (1, 4, 5, 2, 3), 29 hrs., 1 hr., 8 hrs. ; (c) (1, 3, 5, 7, 2, 6, 4), 25 hrs, 3 hrs, 1 hr;

1. (a) The method is not applicable, (b) (4, 3, 2, 1), 89 hrs., 43 hrs., 59 hrs., 59 hrs., 22 hrs. (c) (1, 5, 2, 3, 4), 61 hrs., 48 hrs., 44 hrs., 38 hrs., 40 hrs. (d) (3, 5, 1, 4, 2), 81 hrs. 20 hrs., 38 hrs. 40 hrs., 21 hrs.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy