53213-mt----simulation Modeling Of Manufacturing Systems

Code No: 53213/MT

NR

M.Tech. – II Semester Regular Examinations, September, 2008 SIMULATION MODELLING OF MANUFACTURING SYSTEMS (Common to Advanced Manufacturing Systems/ Industrial Engineering & Management) Time: 3hours

Max. Marks:60 Answer any FIVE questions All questions carry equal marks ---

1.a) b) 2.a) b) c)

3.a)

b)

4.a) b)

Explain various steps involved in developing simulation model, considering that you are developing it for a typical single serve queuing system. “ Simulation is not optimization technique rather it is evaluation technique”. Do you accept or don’t accept? Give reasons for that. Explain various essential properties which an estimator should posses. Explain terms i) Level of significance ii) Power of test. Let p the probability that a coil will fall head in a single toss in order to test H0 : p = ½ against H1 : p = ¾ . The coin is tossed 5 times and H0 is rejected if more than 3 heads are obtained. Find the probability of type I error and power of test. Explain terms i) Verification ii) Validation and iii) Credibility. Explain confidence interval approach for verification of simulation model with real world observations. Also explain in clear terms the meaning of statically significant and practically significant. Explain three different approaches for modelling random components of system. Write advantages and disadvantages of each approach. Write characteristics of i) Poisson ii) Binomial iii) Exponential and iv) Weibull distributions. Contd…2.,

Code No: 53213/MT 5.a) b)

::2::

Explain i) Inverse transform method and ii) Acceptance – Rejection Method. Write algorithms to generate random varieties from the following distributions i) Weibull ii) Normal and iii) Binomial.

6.a) b)

Compare GPSS and SIMAN languages. Develop SIMAN model for estimating the average number of customers in the single server queuing system.

7.a)

Explain two types of simulation with respect to output data analysis. Explain the replication method for output data analysis to estimate performance measures to 95% confidence interval limits.

b) 8.

Consider the following Job shop problem Number of Jobs = 3 Number of Machines = A B C D processing times (mints) as follows M/Job 1 2 3 Job 1 2 3

A 11 10 8

B 6 3 7

C 4 6 12

Processing order A B C B C D A C B

D 19 7 16 D A D

Scheduling policy when jobs compete for any machine is shortest processing Time (SPT) rule. Simulate and determine total time required to complete all jobs according to SPT rule. $$$