Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
64Activity
0 of .
Results for:
No results containing your search query
P. 1
Production Planning

Production Planning

Ratings: (0)|Views: 612|Likes:
Published by mlsemira1546
Downloaded file from SCRIBD
Downloaded file from SCRIBD

More info:

Published by: mlsemira1546 on Dec 12, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

01/25/2011

pdf

text

original

 
9) a) Draw a flow chart to explain the procedure to schedule ‘n’ jobs on twomachines:Ans:
The following are the ten steps involved to schedule ‘n’ jobs on two machines:Step 1) Prepare list of the jobs to be processed on the two machines.Step 2) Estimate processing time for each job on each machine.Step 3) Construct a job array, called sequencing matrix. To construct the matrix the jobsto be processed are recorded row head wise, the machines to be employed to process the jobs are recorded column head wise and the processing time of each job is recordedagainst the under the respective machine.Step 4) Scan the job array and identify the smallest processing time.Step 5) If the smallest time appears:i.On the first machine, A, assign the corresponding jobs as close to the beginning of the job sequence as possible.ii.On the second machine, schedule the corresponding job as close to the endof the job sequence as possible.iii.If there is a tie of minima for both machines i.e., if the smallest elementoccurs on both machines, (one minimal element on each machine), selectamong the tied up jobs the one with the smallest time on the first machineand schedule it as early in the job sequence as possible.iv.If the tie of the minima occurs among the elements of the first machine,select among the tied up jobs the one with the smallest time on the secondmachine and schedule it as early in the job sequence as possible.v.If the tie for the minima occurs among the elements in the secondmachine, select among the tied up jobs the one with the smallest time onthe first machine and schedule it as late in the sequence as possible.Step 6) Delete from the array the jobs scheduled and its corresponding processing times.Step 7) Repeat steps 4, 5, 6 and 7 for remaining processing times, placing the jobs next tofirst or next to last until all jobs are scheduled.Step 8) Calculate the total elapsed time to process all jobs through the two machines.Step 9) Calculate the idle time for machines A and B.
 
Fig: Flow chart for”n jobs: 2 machines” sequencing model
    S     T      A      R     T
Construct a sequencing matrix withn jobs and two machines (A & B)Scrutinize processing time of all jobs on both machines and select thesmallest time
Does thesmallesttime occur 
Schedule the jobcorresponding to thesmallest time as closeto the end of the jobsequence as possibleSchedule the job corresponding to thesmallest time as close to the beginning of the job sequence as possible.Delete the job scheduled and itscorresponding processing timesHave allobs beenscheduledCalculate start and finish time of each job on machine ACalculate start and finish time of each job on machine BDetermine total elapsed time to process all jobs though two machinesCalculate idle time of each machine
STOP
 
NoNoYesYes
 
b) Five jobs A, B, C, D and E are required to be processed on two machines M1 andM2. Each job has to be processed on machine M1 and then on machine M2. Theorder of the completion of jobs has no significance. The processing time hours forfive jobs on the two machines is as under:Ans
: The smallest time in the job array is 2 hours and it appears for the first stage. Thecorresponding job D therefore is scheduled last and its entry is made in the last cell of thesequencing bar.Delete the corresponding job schedule leaves us 4 jobs in the array.The next smallest time is 4 hrs and it occurs on the job A which is present in the sequenceof Machine #1. Therefore the entry is made in the first cell of the sequencing bar.Deleting the job schedule leaves us with 3 more entries in the array.The next smallest time is 6 and is present in the job E, which is present in the sequence of Machine #2. Therefore the entry is made in the last but one cell of the bar.Deleting the job schedule leaves us with 2 more entries in the array.The next smallest time is 7 and is present in the job B, which is present in the sequence of Machine #2. Therefore the entry is made in the 3rd cell of the bar.
JobMachineABCDEMachine #141714911Machine #2571226DADEADEB

Activity (64)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
sizweh liked this
meatulin09 liked this
chi005 liked this
sushmamom liked this
sushmamom liked this
ady4all liked this
kikky_cik liked this
Arafat121 liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->