SlideShare ist ein Scribd-Unternehmen logo
1 von 9
Downloaden Sie, um offline zu lesen
Layout Planning



The term 'layout planning' can be applied at various levels of planning:

Plant location planning (where you are concerned with location of a factory or a warehouse or
other facility.) This is of some importance in design of multi-nationally cooperating, Global-
supply Chain systems.



Department location Planning: This deals with the location of different departments or sections
within a plant/factory. This is the problem we shall study in a little more detail, below.



Machine location problems: which deal with the location of separate machine tools, desks,
offices, and other facilities within each cell or department.



Detailed planning: The final stage of a facility planning is the generation, using CAD tools or
detailed engineering drawings, of scaled models of the entire floor plans, including details such
as the location of power supplies, cabling for computer networks and phone lines, etc.




The Department Location Problem: A department is defined as any single, large resource, with a
well defined set of operations, and fixed material entry and exit points. Examples range from a
large machine tool, or a design department. The aim is to develop a BLOCK PLAN showing the
relative locations of the departments.



Criteria: The primary criteria for evaluating any layout will be the:

MINIMIZATION of material handling costs.

MH cost components: depreciation of MH equipment, variable operating costs, labor expenses.
Also, MH costs are typically directly proportional to (a) the frequency of movement of material,
and (b) The length over which material is moved.
Advantages of these criteria (reduced material movements):

   1.   Reduction of Aisle space required.
   2.   Lower WIP levels
   3.   Lower throughput times
   4.   Less product damage and lower obsolescence
   5.   Reduced storage space
   6.   Simplified material control and scheduling
   7.   Less congestion in system.



Consider the following:




Location of next operation                 Material Handled per move

adjacent machine                           single part

across the aisle                           unit load

across the plant                           lot size of over 1 hour of production

another plant                              one day's production




At each stage, the WIP is increasing by as much as 10 times.



The most popular layout for complex systems is the SPINE LAYOUT. Examples are shown in
the following figure.
The spine defines a central channel of material flow for the entire facility. Each department
branches out of this central core. Ideally, each department has its own input/output area along the
spine. This departmental point of usage concept reduces material flow.



We shall now look at some details of how to locate departments along a spine to optimize the
flow of materials. Let us first try to see if we can evaluate whether there is a dominant flow
pattern in a manufacturing system or not.



fij = flow volume (trips/time) between department I and j.

hij = cost/unit distance for the material handling system.

The cost = unit fixed cost + unit variable cost.



We define the weight of the cost of moving material between departments i and j as:



wij = fij.hij



Given the values of all the wij's, one measure of flow dominance is the coefficient of variation,
defined as:
What do different computed values of f mean ?



Clearly, f=0 implies that there is no significant variation of flow volumes between different pairs
of departments. In such cases, almost any solution for layouts will be close to optimal.

Similarly, if f is large (>2), it implies that some flows in the system are very low, while others are
extremely dominant. This is typical for assembly lines types of systems. It is easy to design the
layout for such systems (Why?).

However, if the value of f is close to 1, then it is difficult to see dominant flows, and other
techniques of layout design need to be employed.



One such technique is the manual design methodology developed by Muther, called:



Systematic Layout Planning



The figure below shows the steps of this methodology.
The method can be described in terms of the basic steps:

   1. Data Collection: A study of the Product Mix, Quantity of each product to be produced,
      Routing for each product, Support services needed, and the Schedule (or the timing and
      transport issues related to production schedules of the products types).
   2. Flow Analysis: whence we identify what each department will be, what its inputs and
      outputs are likely to be, specification of physical workstations required to do the tasks (in
      the process plan) etc.

       At the early stages, this involves considerations of quantity of material flow, as well as
       overall flow lines that could be better in the implementation of departments.

       Examples include straight-line flow, S-shaped flow, U-shaped flow, or W-shaped flows.
       Further, even for a spine shaped system, the spine geometry can be straight line, or U-
       shaped (the latter case is useful if a single material receiving/delivery point is preferred.)

   3. Quantitative analysis: Some factors, such as flow costs, can be quantified. Several others
      are not so easy to quantify. For example
          a. MH receiving and delivery stations to be kept together.
          b. Delicate testing equipment should be placed far from high vibration areas, etc.
Such relationships can be quantified by using REL diagrams, as shown in the
           figure below. The relative importance of each factor is expressed in terms of
           subjective evaluations, ranging from A (absolutely necessary) to U (unnecessary),
           and X (necessary to keep apart).

           The diagram can also give reasons for such decisions. An example is shown
           below.




4. Relationship Diagram: The quantitative and qualitative analysis is combined into a
   relationship diagram. One way to do this is to assign some numerical values to the A-X
   ratings, (typically, large integer for A-rating, 0 for U-rating, and large -ve integer for X-
   rating).

   These ratings can then be used to determine the closeness rating for each department as
   the sum of all the rating-values of all links coming into it. Usually, a department with a
   large rating value should have significant links will many other departments, and should
   therefore be at the center of the layout (to be close to all other departments.)

   We can now use these ratings (or their numerical values) to define the total closeness
   rating of different departments. If V(X) is a function which defines the value of
   achieving closeness between two departments, the total closeness rating of a department
   can be defined as the sum of its closeness rating values for all its sister departments.
To give a numerical example, assume that we allow: V(A) = 81, V(E) = 27, V(I) =9,
V(O) = 3 and V(U) = 1. Then the closeness ratings corresponding to each department in
the example figure above are:




               Department                     Total
                                              Closeness
                                              Rating

               SR                             9+3+9+3+81
                                              = 105

               PC                             9+0+1+1+27
                                              = 38

               PS                             58

               IC                             39

               XT                             35

               AT                             165




In the above, the X-ratings were ignored in order to allow each department to have a fair
chance in placement in the initial design of the layout. The real value of this rating will be
used later, when we put some effort into modification on the first-guess solution.

Forming the first guess solution (greedy algorithm):

Step 1. Notice that AT has the highest rating, and so is placed in the center of the layout
(why ?)

Step 2. The next highest ranked department is SR, which may be placed adjacent to AT
due to their mutual A-rating. We put it on top of AT.

Step 3. Next up is PS, which should go adjacent to AT (since V(AT,PS) is the highest
rated closeness value for PS.

Step 4. Next comes XT, which should be close to PS.

Step 5. Next is IC, which should be close to AT and is placed below it.

Step 6. Finally, we have PC, which must stay away from PS.
Using these directions, we have a first attempt at the layout as follows:




   Notice the odd shape of the final layout. This does not matter, since we still have not
   considered the relative sizes of the departments. But before considering that, we must
   also attempt to improve upon our greedy solution.

   One heuristic to do so is called the 2-Opt method. A k-opt method is said to have
   converged when any switching between k variables (in this case, locations of
   departments) cannot improve upon the objective (in our case, minimization of the total
   MH cost).

   The 2-Opt procedure to improve on the greedy solution is pretty straightforward, and
   described rather well in your text (Askin and Standridge, pp 219). In summary, it is a hill-
   climbing heuristic, in which, starting from the initial solution, at each step we compute
   the reduction (if any) in cost associated with switching the positions of each pair of
   departments.

   The pair which yields the maximum reduction in costs (steepest local benefit) is selected
   at this step. The switch is made, and the procedure continues, until at some stage, we are
   unable to find any pair-switch which improves on the MH cost.

   In the above, the MH cost associated with any pair of departments is often based on the
   estimated MH cost factor, wij that we computed earlier, multiplied by an estimate of the
   distance between the two cells.



5. Space requirements: these are determined based on industrial standards, equipment
   required, shelf space required, etc.
6. Space availability: this is determined based on the economic analysis, as well as on other
   constraints that may arise (especially if the system is to be housed in an existing facility).
   The last two considerations will give an estimate of total space for each department, and
   sometimes also the shape of each department (based on flow type within the department).
7. Space relationship diagram: In this part, we substitute in the actual area on each
      department, and fit the departments into the available space. Usually, the solution
      methods may be computer-assisted heuristics, or just direct visual methods.
   8. Putting in the constraints: Finally, other existing constraints are employed to cut down the
      number of feasible solutions, to result in a small set of solutions. from among these,
      direct comparison can be used to rank, eliminate, or select the optimum design.




These notes are based largely on material from the text (Askin and Standridge, as well as some
material from the text on Facilities Planning, by James Tompkins and John White (pub. John
Wiley).

Weitere ähnliche Inhalte

Was ist angesagt?

Balancing the line by using heuristic method based on cpm in salbp –a case study
Balancing the line by using heuristic method based on cpm in salbp –a case studyBalancing the line by using heuristic method based on cpm in salbp –a case study
Balancing the line by using heuristic method based on cpm in salbp –a case studyeSAT Journals
 
Line balancing ppt By Wakil Kumar
Line balancing ppt By Wakil KumarLine balancing ppt By Wakil Kumar
Line balancing ppt By Wakil KumarWakil Kumar
 
Assembly line balancing
Assembly line balancingAssembly line balancing
Assembly line balancingRohit Goutam
 
Job Shop Scheduling with Setup Times Release times and Deadlines
Job Shop Scheduling with Setup Times  Release times and DeadlinesJob Shop Scheduling with Setup Times  Release times and Deadlines
Job Shop Scheduling with Setup Times Release times and DeadlinesAlkis Vazacopoulos
 
Industrial engineeering pli
Industrial engineeering   pliIndustrial engineeering   pli
Industrial engineeering pliDhyey Shukla
 
Production Management and Scheduling
Production Management and SchedulingProduction Management and Scheduling
Production Management and SchedulingShankha Goswami
 
Final line balancing ppt 4
Final line balancing ppt 4Final line balancing ppt 4
Final line balancing ppt 4navyamukhi1
 
Assembly line balancing
Assembly line balancingAssembly line balancing
Assembly line balancingshady anwer
 
Systematic layout planning
Systematic layout planningSystematic layout planning
Systematic layout planningpriyanka verma
 
Line balancing example
Line balancing exampleLine balancing example
Line balancing examplePrakash Kale
 
22d2 optimal assembly line balancing222
22d2 optimal assembly line balancing22222d2 optimal assembly line balancing222
22d2 optimal assembly line balancing222harkesh singh
 
Facility layout
Facility layoutFacility layout
Facility layoutĐán Lê
 

Was ist angesagt? (20)

Line balancing
Line balancingLine balancing
Line balancing
 
Balancing the line by using heuristic method based on cpm in salbp –a case study
Balancing the line by using heuristic method based on cpm in salbp –a case studyBalancing the line by using heuristic method based on cpm in salbp –a case study
Balancing the line by using heuristic method based on cpm in salbp –a case study
 
Layout10
Layout10Layout10
Layout10
 
Line balancing ppt By Wakil Kumar
Line balancing ppt By Wakil KumarLine balancing ppt By Wakil Kumar
Line balancing ppt By Wakil Kumar
 
Assembly line balancing
Assembly line balancingAssembly line balancing
Assembly line balancing
 
Job Shop Scheduling with Setup Times Release times and Deadlines
Job Shop Scheduling with Setup Times  Release times and DeadlinesJob Shop Scheduling with Setup Times  Release times and Deadlines
Job Shop Scheduling with Setup Times Release times and Deadlines
 
Industrial engineeering pli
Industrial engineeering   pliIndustrial engineeering   pli
Industrial engineeering pli
 
Assembly line balancing
Assembly line balancingAssembly line balancing
Assembly line balancing
 
Production Management and Scheduling
Production Management and SchedulingProduction Management and Scheduling
Production Management and Scheduling
 
Final line balancing ppt 4
Final line balancing ppt 4Final line balancing ppt 4
Final line balancing ppt 4
 
Assembly line balancing
Assembly line balancingAssembly line balancing
Assembly line balancing
 
Line balancing
Line balancingLine balancing
Line balancing
 
Design of robust layout for dynamic plant layout layout problem 1
Design of robust layout for dynamic plant layout layout problem 1Design of robust layout for dynamic plant layout layout problem 1
Design of robust layout for dynamic plant layout layout problem 1
 
Systematic layout planning
Systematic layout planningSystematic layout planning
Systematic layout planning
 
Line balancing example
Line balancing exampleLine balancing example
Line balancing example
 
22d2 optimal assembly line balancing222
22d2 optimal assembly line balancing22222d2 optimal assembly line balancing222
22d2 optimal assembly line balancing222
 
Line balancing
Line balancingLine balancing
Line balancing
 
Line balancing
Line balancing Line balancing
Line balancing
 
Facility layout
Facility layoutFacility layout
Facility layout
 
Facility layout
Facility layoutFacility layout
Facility layout
 

Ähnlich wie Layout planning

IRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment Problem
IRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment ProblemIRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment Problem
IRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment ProblemIRJET Journal
 
Production & Operation Management Chapter28[1]
Production & Operation Management Chapter28[1]Production & Operation Management Chapter28[1]
Production & Operation Management Chapter28[1]Hariharan Ponnusamy
 
Nt1310 Unit 1 Algorithm Paper
Nt1310 Unit 1 Algorithm PaperNt1310 Unit 1 Algorithm Paper
Nt1310 Unit 1 Algorithm PaperTiffany Graham
 
Programming in python
Programming in pythonProgramming in python
Programming in pythonIvan Rojas
 
On fuzzy concepts in engineering ppt. ncce
On fuzzy concepts in engineering ppt. ncceOn fuzzy concepts in engineering ppt. ncce
On fuzzy concepts in engineering ppt. ncceSurender Singh
 
Recognition of Handwritten Mathematical Equations
Recognition of  Handwritten Mathematical EquationsRecognition of  Handwritten Mathematical Equations
Recognition of Handwritten Mathematical EquationsIRJET Journal
 
An Algorithm for Optimized Cost in a Distributed Computing System
An Algorithm for Optimized Cost in a Distributed Computing SystemAn Algorithm for Optimized Cost in a Distributed Computing System
An Algorithm for Optimized Cost in a Distributed Computing SystemIRJET Journal
 
FIT5196-S2-2023 Assessment 3.pdf
FIT5196-S2-2023 Assessment 3.pdfFIT5196-S2-2023 Assessment 3.pdf
FIT5196-S2-2023 Assessment 3.pdf1914848496c
 
Principal component analysis and lda
Principal component analysis and ldaPrincipal component analysis and lda
Principal component analysis and ldaSuresh Pokharel
 
Machine learning session8(svm nlp)
Machine learning   session8(svm nlp)Machine learning   session8(svm nlp)
Machine learning session8(svm nlp)Abhimanyu Dwivedi
 
Oracle_Analytical_function.pdf
Oracle_Analytical_function.pdfOracle_Analytical_function.pdf
Oracle_Analytical_function.pdfKalyankumarVenkat1
 
Nichols Company Casae Study
Nichols Company Casae StudyNichols Company Casae Study
Nichols Company Casae StudyJennifer Reither
 
Product failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamicProduct failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamicnaga ram
 
A Verified Modern SAT Solver
A Verified Modern SAT SolverA Verified Modern SAT Solver
A Verified Modern SAT SolverKatie Naple
 
Comparison of Various RCNN techniques for Classification of Object from Image
Comparison of Various RCNN techniques for Classification of Object from ImageComparison of Various RCNN techniques for Classification of Object from Image
Comparison of Various RCNN techniques for Classification of Object from ImageIRJET Journal
 
Unit 5 Programming Portfolio 1
Unit 5 Programming Portfolio 1Unit 5 Programming Portfolio 1
Unit 5 Programming Portfolio 1Jamie Boyd
 
Machine Learning.pdf
Machine Learning.pdfMachine Learning.pdf
Machine Learning.pdfBeyaNasr1
 

Ähnlich wie Layout planning (20)

IRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment Problem
IRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment ProblemIRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment Problem
IRJET- Comparison for Max-Flow Min-Cut Algorithms for Optimal Assignment Problem
 
Production & Operation Management Chapter28[1]
Production & Operation Management Chapter28[1]Production & Operation Management Chapter28[1]
Production & Operation Management Chapter28[1]
 
Plant Layout Guide
Plant Layout GuidePlant Layout Guide
Plant Layout Guide
 
Nt1310 Unit 1 Algorithm Paper
Nt1310 Unit 1 Algorithm PaperNt1310 Unit 1 Algorithm Paper
Nt1310 Unit 1 Algorithm Paper
 
Programming in python
Programming in pythonProgramming in python
Programming in python
 
On fuzzy concepts in engineering ppt. ncce
On fuzzy concepts in engineering ppt. ncceOn fuzzy concepts in engineering ppt. ncce
On fuzzy concepts in engineering ppt. ncce
 
Recognition of Handwritten Mathematical Equations
Recognition of  Handwritten Mathematical EquationsRecognition of  Handwritten Mathematical Equations
Recognition of Handwritten Mathematical Equations
 
An Algorithm for Optimized Cost in a Distributed Computing System
An Algorithm for Optimized Cost in a Distributed Computing SystemAn Algorithm for Optimized Cost in a Distributed Computing System
An Algorithm for Optimized Cost in a Distributed Computing System
 
FIT5196-S2-2023 Assessment 3.pdf
FIT5196-S2-2023 Assessment 3.pdfFIT5196-S2-2023 Assessment 3.pdf
FIT5196-S2-2023 Assessment 3.pdf
 
Visual Techniques
Visual TechniquesVisual Techniques
Visual Techniques
 
Principal component analysis and lda
Principal component analysis and ldaPrincipal component analysis and lda
Principal component analysis and lda
 
Oed chapter 1
Oed chapter 1Oed chapter 1
Oed chapter 1
 
Machine learning session8(svm nlp)
Machine learning   session8(svm nlp)Machine learning   session8(svm nlp)
Machine learning session8(svm nlp)
 
Oracle_Analytical_function.pdf
Oracle_Analytical_function.pdfOracle_Analytical_function.pdf
Oracle_Analytical_function.pdf
 
Nichols Company Casae Study
Nichols Company Casae StudyNichols Company Casae Study
Nichols Company Casae Study
 
Product failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamicProduct failure analysis using Explicit dynamic
Product failure analysis using Explicit dynamic
 
A Verified Modern SAT Solver
A Verified Modern SAT SolverA Verified Modern SAT Solver
A Verified Modern SAT Solver
 
Comparison of Various RCNN techniques for Classification of Object from Image
Comparison of Various RCNN techniques for Classification of Object from ImageComparison of Various RCNN techniques for Classification of Object from Image
Comparison of Various RCNN techniques for Classification of Object from Image
 
Unit 5 Programming Portfolio 1
Unit 5 Programming Portfolio 1Unit 5 Programming Portfolio 1
Unit 5 Programming Portfolio 1
 
Machine Learning.pdf
Machine Learning.pdfMachine Learning.pdf
Machine Learning.pdf
 

Kürzlich hochgeladen

Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...
Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...
Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...IMARC Group
 
MoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor PresentationMoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor Presentationbaron83
 
Michael Vidyakin: Introduction to PMO (UA)
Michael Vidyakin: Introduction to PMO (UA)Michael Vidyakin: Introduction to PMO (UA)
Michael Vidyakin: Introduction to PMO (UA)Lviv Startup Club
 
TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...
TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...
TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...TalentView
 
To Create Your Own Wig Online To Create Your Own Wig Online
To Create Your Own Wig Online  To Create Your Own Wig OnlineTo Create Your Own Wig Online  To Create Your Own Wig Online
To Create Your Own Wig Online To Create Your Own Wig Onlinelng ths
 
AMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdf
AMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdfAMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdf
AMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdfJohnCarloValencia4
 
Ethical stalking by Mark Williams. UpliftLive 2024
Ethical stalking by Mark Williams. UpliftLive 2024Ethical stalking by Mark Williams. UpliftLive 2024
Ethical stalking by Mark Williams. UpliftLive 2024Winbusinessin
 
MC Heights construction company in Jhang
MC Heights construction company in JhangMC Heights construction company in Jhang
MC Heights construction company in Jhangmcgroupjeya
 
The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...
The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...
The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...Brian Solis
 
Borderless Access - Global B2B Panel book-unlock 2024
Borderless Access - Global B2B Panel book-unlock 2024Borderless Access - Global B2B Panel book-unlock 2024
Borderless Access - Global B2B Panel book-unlock 2024Borderless Access
 
PDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdfPDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdfHajeJanKamps
 
Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024Borderless Access
 
Project Brief & Information Architecture Report
Project Brief & Information Architecture ReportProject Brief & Information Architecture Report
Project Brief & Information Architecture Reportamberjiles31
 
Talent Management research intelligence_13 paradigm shifts_20 March 2024.pdf
Talent Management research intelligence_13 paradigm shifts_20 March 2024.pdfTalent Management research intelligence_13 paradigm shifts_20 March 2024.pdf
Talent Management research intelligence_13 paradigm shifts_20 March 2024.pdfCharles Cotter, PhD
 
IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...
IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...
IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...AustraliaChapterIIBA
 
Chicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdf
Chicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdfChicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdf
Chicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdfSourav Sikder
 
Cracking the ‘Business Process Outsourcing’ Code Main.pptx
Cracking the ‘Business Process Outsourcing’ Code Main.pptxCracking the ‘Business Process Outsourcing’ Code Main.pptx
Cracking the ‘Business Process Outsourcing’ Code Main.pptxWorkforce Group
 
PDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdfPDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdfHajeJanKamps
 
Fabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and FestivalsFabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and FestivalsWristbands Ireland
 

Kürzlich hochgeladen (20)

Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...
Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...
Boat Trailers Market PPT: Growth, Outlook, Demand, Keyplayer Analysis and Opp...
 
MoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor PresentationMoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor Presentation
 
Michael Vidyakin: Introduction to PMO (UA)
Michael Vidyakin: Introduction to PMO (UA)Michael Vidyakin: Introduction to PMO (UA)
Michael Vidyakin: Introduction to PMO (UA)
 
TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...
TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...
TalentView Webinar: Empowering the Modern Workforce_ Redefininig Success from...
 
To Create Your Own Wig Online To Create Your Own Wig Online
To Create Your Own Wig Online  To Create Your Own Wig OnlineTo Create Your Own Wig Online  To Create Your Own Wig Online
To Create Your Own Wig Online To Create Your Own Wig Online
 
AMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdf
AMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdfAMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdf
AMAZON SELLER VIRTUAL ASSISTANT PRODUCT RESEARCH .pdf
 
Ethical stalking by Mark Williams. UpliftLive 2024
Ethical stalking by Mark Williams. UpliftLive 2024Ethical stalking by Mark Williams. UpliftLive 2024
Ethical stalking by Mark Williams. UpliftLive 2024
 
MC Heights construction company in Jhang
MC Heights construction company in JhangMC Heights construction company in Jhang
MC Heights construction company in Jhang
 
Investment Opportunity for Thailand's Automotive & EV Industries
Investment Opportunity for Thailand's Automotive & EV IndustriesInvestment Opportunity for Thailand's Automotive & EV Industries
Investment Opportunity for Thailand's Automotive & EV Industries
 
The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...
The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...
The End of Business as Usual: Rewire the Way You Work to Succeed in the Consu...
 
Borderless Access - Global B2B Panel book-unlock 2024
Borderless Access - Global B2B Panel book-unlock 2024Borderless Access - Global B2B Panel book-unlock 2024
Borderless Access - Global B2B Panel book-unlock 2024
 
PDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdfPDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdf
 
Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024
 
Project Brief & Information Architecture Report
Project Brief & Information Architecture ReportProject Brief & Information Architecture Report
Project Brief & Information Architecture Report
 
Talent Management research intelligence_13 paradigm shifts_20 March 2024.pdf
Talent Management research intelligence_13 paradigm shifts_20 March 2024.pdfTalent Management research intelligence_13 paradigm shifts_20 March 2024.pdf
Talent Management research intelligence_13 paradigm shifts_20 March 2024.pdf
 
IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...
IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...
IIBA® Melbourne - Navigating Business Analysis - Excellence for Career Growth...
 
Chicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdf
Chicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdfChicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdf
Chicago Medical Malpractice Lawyer Chicago Medical Malpractice Lawyer.pdf
 
Cracking the ‘Business Process Outsourcing’ Code Main.pptx
Cracking the ‘Business Process Outsourcing’ Code Main.pptxCracking the ‘Business Process Outsourcing’ Code Main.pptx
Cracking the ‘Business Process Outsourcing’ Code Main.pptx
 
PDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdfPDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdf
 
Fabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and FestivalsFabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and Festivals
 

Layout planning

  • 1. Layout Planning The term 'layout planning' can be applied at various levels of planning: Plant location planning (where you are concerned with location of a factory or a warehouse or other facility.) This is of some importance in design of multi-nationally cooperating, Global- supply Chain systems. Department location Planning: This deals with the location of different departments or sections within a plant/factory. This is the problem we shall study in a little more detail, below. Machine location problems: which deal with the location of separate machine tools, desks, offices, and other facilities within each cell or department. Detailed planning: The final stage of a facility planning is the generation, using CAD tools or detailed engineering drawings, of scaled models of the entire floor plans, including details such as the location of power supplies, cabling for computer networks and phone lines, etc. The Department Location Problem: A department is defined as any single, large resource, with a well defined set of operations, and fixed material entry and exit points. Examples range from a large machine tool, or a design department. The aim is to develop a BLOCK PLAN showing the relative locations of the departments. Criteria: The primary criteria for evaluating any layout will be the: MINIMIZATION of material handling costs. MH cost components: depreciation of MH equipment, variable operating costs, labor expenses. Also, MH costs are typically directly proportional to (a) the frequency of movement of material, and (b) The length over which material is moved.
  • 2. Advantages of these criteria (reduced material movements): 1. Reduction of Aisle space required. 2. Lower WIP levels 3. Lower throughput times 4. Less product damage and lower obsolescence 5. Reduced storage space 6. Simplified material control and scheduling 7. Less congestion in system. Consider the following: Location of next operation Material Handled per move adjacent machine single part across the aisle unit load across the plant lot size of over 1 hour of production another plant one day's production At each stage, the WIP is increasing by as much as 10 times. The most popular layout for complex systems is the SPINE LAYOUT. Examples are shown in the following figure.
  • 3. The spine defines a central channel of material flow for the entire facility. Each department branches out of this central core. Ideally, each department has its own input/output area along the spine. This departmental point of usage concept reduces material flow. We shall now look at some details of how to locate departments along a spine to optimize the flow of materials. Let us first try to see if we can evaluate whether there is a dominant flow pattern in a manufacturing system or not. fij = flow volume (trips/time) between department I and j. hij = cost/unit distance for the material handling system. The cost = unit fixed cost + unit variable cost. We define the weight of the cost of moving material between departments i and j as: wij = fij.hij Given the values of all the wij's, one measure of flow dominance is the coefficient of variation, defined as:
  • 4. What do different computed values of f mean ? Clearly, f=0 implies that there is no significant variation of flow volumes between different pairs of departments. In such cases, almost any solution for layouts will be close to optimal. Similarly, if f is large (>2), it implies that some flows in the system are very low, while others are extremely dominant. This is typical for assembly lines types of systems. It is easy to design the layout for such systems (Why?). However, if the value of f is close to 1, then it is difficult to see dominant flows, and other techniques of layout design need to be employed. One such technique is the manual design methodology developed by Muther, called: Systematic Layout Planning The figure below shows the steps of this methodology.
  • 5. The method can be described in terms of the basic steps: 1. Data Collection: A study of the Product Mix, Quantity of each product to be produced, Routing for each product, Support services needed, and the Schedule (or the timing and transport issues related to production schedules of the products types). 2. Flow Analysis: whence we identify what each department will be, what its inputs and outputs are likely to be, specification of physical workstations required to do the tasks (in the process plan) etc. At the early stages, this involves considerations of quantity of material flow, as well as overall flow lines that could be better in the implementation of departments. Examples include straight-line flow, S-shaped flow, U-shaped flow, or W-shaped flows. Further, even for a spine shaped system, the spine geometry can be straight line, or U- shaped (the latter case is useful if a single material receiving/delivery point is preferred.) 3. Quantitative analysis: Some factors, such as flow costs, can be quantified. Several others are not so easy to quantify. For example a. MH receiving and delivery stations to be kept together. b. Delicate testing equipment should be placed far from high vibration areas, etc.
  • 6. Such relationships can be quantified by using REL diagrams, as shown in the figure below. The relative importance of each factor is expressed in terms of subjective evaluations, ranging from A (absolutely necessary) to U (unnecessary), and X (necessary to keep apart). The diagram can also give reasons for such decisions. An example is shown below. 4. Relationship Diagram: The quantitative and qualitative analysis is combined into a relationship diagram. One way to do this is to assign some numerical values to the A-X ratings, (typically, large integer for A-rating, 0 for U-rating, and large -ve integer for X- rating). These ratings can then be used to determine the closeness rating for each department as the sum of all the rating-values of all links coming into it. Usually, a department with a large rating value should have significant links will many other departments, and should therefore be at the center of the layout (to be close to all other departments.) We can now use these ratings (or their numerical values) to define the total closeness rating of different departments. If V(X) is a function which defines the value of achieving closeness between two departments, the total closeness rating of a department can be defined as the sum of its closeness rating values for all its sister departments.
  • 7. To give a numerical example, assume that we allow: V(A) = 81, V(E) = 27, V(I) =9, V(O) = 3 and V(U) = 1. Then the closeness ratings corresponding to each department in the example figure above are: Department Total Closeness Rating SR 9+3+9+3+81 = 105 PC 9+0+1+1+27 = 38 PS 58 IC 39 XT 35 AT 165 In the above, the X-ratings were ignored in order to allow each department to have a fair chance in placement in the initial design of the layout. The real value of this rating will be used later, when we put some effort into modification on the first-guess solution. Forming the first guess solution (greedy algorithm): Step 1. Notice that AT has the highest rating, and so is placed in the center of the layout (why ?) Step 2. The next highest ranked department is SR, which may be placed adjacent to AT due to their mutual A-rating. We put it on top of AT. Step 3. Next up is PS, which should go adjacent to AT (since V(AT,PS) is the highest rated closeness value for PS. Step 4. Next comes XT, which should be close to PS. Step 5. Next is IC, which should be close to AT and is placed below it. Step 6. Finally, we have PC, which must stay away from PS.
  • 8. Using these directions, we have a first attempt at the layout as follows: Notice the odd shape of the final layout. This does not matter, since we still have not considered the relative sizes of the departments. But before considering that, we must also attempt to improve upon our greedy solution. One heuristic to do so is called the 2-Opt method. A k-opt method is said to have converged when any switching between k variables (in this case, locations of departments) cannot improve upon the objective (in our case, minimization of the total MH cost). The 2-Opt procedure to improve on the greedy solution is pretty straightforward, and described rather well in your text (Askin and Standridge, pp 219). In summary, it is a hill- climbing heuristic, in which, starting from the initial solution, at each step we compute the reduction (if any) in cost associated with switching the positions of each pair of departments. The pair which yields the maximum reduction in costs (steepest local benefit) is selected at this step. The switch is made, and the procedure continues, until at some stage, we are unable to find any pair-switch which improves on the MH cost. In the above, the MH cost associated with any pair of departments is often based on the estimated MH cost factor, wij that we computed earlier, multiplied by an estimate of the distance between the two cells. 5. Space requirements: these are determined based on industrial standards, equipment required, shelf space required, etc. 6. Space availability: this is determined based on the economic analysis, as well as on other constraints that may arise (especially if the system is to be housed in an existing facility). The last two considerations will give an estimate of total space for each department, and sometimes also the shape of each department (based on flow type within the department).
  • 9. 7. Space relationship diagram: In this part, we substitute in the actual area on each department, and fit the departments into the available space. Usually, the solution methods may be computer-assisted heuristics, or just direct visual methods. 8. Putting in the constraints: Finally, other existing constraints are employed to cut down the number of feasible solutions, to result in a small set of solutions. from among these, direct comparison can be used to rank, eliminate, or select the optimum design. These notes are based largely on material from the text (Askin and Standridge, as well as some material from the text on Facilities Planning, by James Tompkins and John White (pub. John Wiley).