MM

© All Rights Reserved

3 views

MM

© All Rights Reserved

- Hsn & Maio(Good)
- LMS Variants
- Matlab_3
- Assignment Problems
- Data Remaja
- data mining techniques
- VBsample Preview
- Maths Consultations S1 2017
- A Study of Image Compression Methods
- Shift Invariant Ear Feature Extraction using Dual Tree Complex Wavelet Transform for Ear Recognition
- Module 6.Scilab
- mvg_exercisesheet_01
- 6 SasMiner Clustering
- TouchSpin Gaming Investor Deck
- Risk and Regulation 26 Winter 2013(1)
- Graphing Linear Equations
- 1. Barber Shop- Single Server
- Classifying Images of Materials- Achieving Viewpoint and Illumination in- Dependence
- Final_Student Practice Sheet _AHP Example
- Example Generator non random

You are on page 1of 11

Sequencing of n-jobs through 2-machines

Assumptions

1. The processing times on different machines are

independent of the order of the job in which

they are to be processed;

2. Only one job can be processed on a given

machine at a time;

3. The time taken by the jobs moving from one

machine to another is negligible & taken as

equal to ‘zero’;

4. Each job, once started on a machine is to be

performed up to the completion on that

machine;

Sequencing of n-jobs through 2-machines

6. All jobs are known & are ready for processing

before the period under consideration begins;

7. Processing times are given and do not change

Sequencing Jobs Through Two Serial

Process

Johnson’s Rule

1. List time required to process each job at each

machine. Set up a one-dimensional matrix to

represent desired sequence with # of slots equal

to # of jobs.

2. Select smallest processing time at either

machine. If that time is on machine 1, put the

job as near to beginning of sequence as possible.

3. If smallest time occurs on machine 2, put the job

as near to the end of the sequence as possible.

4. Remove job from list.

5. Repeat steps 2-4 until all slots in matrix are

filled and all jobs are sequenced.

Numerical – Example (2-machines)

• In a machine shop. 8 different products are being

manufactured each requiring time on two machines in

the sequence A -> B as follows :

Product 1 2 3 4 5 6 7 8

Time in M/c ‘A’ 30 45 15 20 80 120 65 10

(in minutes)

• Find out (i) Optimum sequence, (ii) Total Elapsed

time for optimum sequence, (iii) Idle time in both the

machines, and (Iv) Total waiting time.

Product M/c 1 M/c 2

OPTIMUM SEQUENCE

1 30 20

2 45 30

3 15 50

4 20 35 8 3 4 7 6 5 2 1

5 80 36

6 120 40

7 65 50

8 10 20

Calculation of Elapsed time, Idle time & Waiting

time

Time In Time out Time in Time out M/c A M/c B time

8 0 (+10) 10 10(+20) 30 10

3 10 (+15) 25 30(+50) 80 5

7 45(+65) 110 115(+50) 165 5

Total 144 45

Sequencing of n-jobs through more than 2

machines

EXAMPLE (SAY n-JOBS THRU’ 3-MACHINES)

Assumptions (in addition to whatever in case of

2-machines)

1) The smallest processing time on Machine ≠ 1 is

greater than or equal to the largest processing

time on Machine≠ 2;

2)The smallest processing time on Machine≠ 3 is

greater than or equal to the largest processing

time on Machine≠2.

Re-write the given problem in the form of n-jobs

through 2-machines, as explained the following

numerical.

Numerical

• 5 jobs have to be processed through 3 machines X, Y, & Z

in the order X→Y→Z . Processing times are given below :

Jobs Processing time in minutes

X Y Z

1 9 6 5

2 10 7 10

3 7 4 8

4 8 3 7

5 12 5 4

Find out i) sequencing, ii) Elapsed time, iii) Idle time and iv)

Waiting time.

Numerical

Solution

• Convert this into two machines:

Jobs M/c ≠ G (X+Y) M/c ≠ H(Y+Z)

1 15 11

2 17 17

3 11 12

4 11 10

5 17 9

3 2 1 4 5

Numerical

Time Time Time Time Time Time X Y Z time

in out in out in out

3 0(+7) 7 7(+4) 11 11(+8) 19 - 7 11 -

2 7(+10) 17 17(+7) 24 24(+10) 34 - 6 5 -

1 17(+9) 26 26(+6) 32 34(+5) 39 - 2 - 2

4 26(+8) 34 34(+3) 37 39((+7) 46 - 2 - 2

5 34(+12) 46 46(+5) 51 51(+4) 55 9 13 - -

- Hsn & Maio(Good)Uploaded byYogesh Kumar
- LMS VariantsUploaded byjsmith84
- Matlab_3Uploaded bysumitr93
- Assignment ProblemsUploaded bySudip Thakur
- Data RemajaUploaded byAnnisa Belladiena
- data mining techniquesUploaded bysangeetanair2014
- VBsample PreviewUploaded byveeraindraraturi
- Maths Consultations S1 2017Uploaded bythinking_of_u32
- A Study of Image Compression MethodsUploaded byInternational Organization of Scientific Research (IOSR)
- Shift Invariant Ear Feature Extraction using Dual Tree Complex Wavelet Transform for Ear RecognitionUploaded byidesajith
- Module 6.ScilabUploaded byorg25gr
- mvg_exercisesheet_01Uploaded bylukkio
- 6 SasMiner ClusteringUploaded byFredy Vivanco
- TouchSpin Gaming Investor DeckUploaded bySuman SINGH
- Risk and Regulation 26 Winter 2013(1)Uploaded byTom Trevatt
- Graphing Linear EquationsUploaded byMisterLemus
- 1. Barber Shop- Single ServerUploaded byAnonymous nAgI6T
- Classifying Images of Materials- Achieving Viewpoint and Illumination in- DependenceUploaded byfirwallpro
- Final_Student Practice Sheet _AHP ExampleUploaded bykpmits
- Example Generator non randomUploaded byVioleta Boullosa
- Methods-Class8Uploaded byDenis Eydelman
- lecture15 (1) (1).pptUploaded byCharlaine Bufi Pancho
- AnEnhancedOpposition-basedFireflyAlgorithmforSolvingComplexoptimizationproblemsKellyULMjournal20141.pdfUploaded byfitria
- ricartUploaded byIam Sunny
- 2017FIN_MS13Uploaded byDattatreya Dattu
- Final Exam Linear AlgebraUploaded byAsari Mbiam-Ekpe
- n16.pdfUploaded byChristine Straub
- Ch3 SlidesUploaded byArso
- hw2Uploaded bywerwerwer
- Lecture 03Uploaded byAbhay Vikram

- 510Uploaded bychenumalla
- Hayt8e_SM_Ch5.pdfUploaded byEli Brito
- selected solutionUploaded byMuiz Zahuri
- Linear AlgebraUploaded byMohammed Arshad Siddiqui
- Dirichlet Boundary ConditionUploaded byRahul Saha
- Discrete Functions LessonsUploaded byjackietsanggg
- EECS-2012-217Uploaded byAnonymous lEBdswQXmx
- Assignment 3Uploaded bybr3nt
- La Places EquationUploaded bymustafa
- The Levenberg-Marquardt algorithm-Implementation and theoryUploaded byJiayao Li
- ch36.pdfUploaded byRodrigo Silva Quirino
- Calculator TricksUploaded byChandra Shekhar Shastri
- Geometric Reference Systems in GeodesyUploaded byhammoudeh13
- From Characteristic Functions and Fourier Transforms to PDFs/CDFs and Option PricesUploaded bylycancapital
- New BookUploaded byHamza Zahid
- Decimals PresentationUploaded byEmie Grace Villavicencio Moting
- Bogdan Ciubotaru - Chapter 1 (Lect) [IV-B1-RSA, 2013-14-II] [en]Uploaded byAndrey Fox
- Geometry of SurfacesUploaded byFrancesco Beccuti
- P436_Lect_18p5 - lorentz transformationUploaded byMarjan Jahorovic
- Davar Khoshnevisan-Probability (Graduate Studies in Mathematics) (2007)Uploaded byafalvareze
- 24142Uploaded byShikha Agarwal
- MIT18_05S14_Reading10b.pdfUploaded byIslamSharaf
- Brown Interval Binomial ProportionUploaded byMarcos Onreva
- (2002) Ocean Waves and Oscillating Systems.pdfUploaded bySergi Moto
- VectorsUploaded byBonito Mathew
- 0011033Uploaded bymlmilleratmit
- Trigo SolutionUploaded byDao Dacullo
- Solution to problems Solution to problemsSolution to problemsUploaded byviluk
- Probability Normal DistributionUploaded byHayati Aini Ahmad
- New Text DocumentUploaded byyozovugas