1 / 24

This Program is Presented as Oral Bulletin at XXV. National Conference

This Program is Presented as Oral Bulletin at XXV. National Conference on Operational Research/Industrial Engineering (OR/IE) ( Koç University, July 4-6, 2005 ). WITH LEAN MANUFACTURING COMPONENTS PREPARING A MATHEMATICAL MODEL AND A COMPUTER PROGRAM FOR LINE BALANCING PROBLEM.

eden-richardson
Download Presentation

This Program is Presented as Oral Bulletin at XXV. National Conference

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. This Program is Presented as Oral Bulletin at XXV. National Conference on Operational Research/Industrial Engineering (OR/IE) ( Koç University, July 4-6, 2005 )

  2. WITH LEAN MANUFACTURING COMPONENTS PREPARING A MATHEMATICAL MODEL AND A COMPUTER PROGRAM FOR LINE BALANCING PROBLEM ARİF GÜRSOY, BELGİN VATANSEVER SCIENCE FAC., MATHS DEPART. COMP. SCIENCE, MASTER STU. PROF. DR. URFAT NURİYEV SCIENCE FAC., MATHS DEPART. COMP. SCIENCE, ASSIST. PROF. MÜCELLA GÜNER ENGINEERING FAC., TEXTILE ENGINEERING DEPART. RESEARCH ASSIST. MURAT ERŞEN BERBERLER SCIENCE FAC., MATHS DEPART. COMP. SCIENCE

  3. THE AIM: For line balancing in manufacturing,in order to • Provide regular work flow, • Make idle times that may occur at workstations and cannot be removed , be at least determining the ideal production quantity.

  4. Line Balancing Line balancing is the problem of assigning approximately the same amount of workload to each workstatition and reducing the idle time to a minimal degree for smooth production. Lean Production • Just-In-Time Production • Lean Manufacturing Components • Worker • Cellular Production • Synchronization Between Machines and Workshops

  5. PROCESS CHART Process chart is a diagram on which all tasks,control flow and material entry points in process are indicated.

  6. MANUFACTURING OPERATIONS OF TROUSERS-SKIRT

  7. PROCESS CHART FOR TROUSERS-SKIRT

  8. Bin notion: Daily working time of a worker ( min. ) e.g. , 540 (+ overtime ) min. Pack size notion: Required time for any production quantity of any operation For example; 1st pack’s size =Standart unit time of 1st operation * production quantity 2nd pack’s size =Standart unit time of 2nd operation * production quantity Pack size of any operation changes according to production quantity; on the other hand,size difference between two packs at the same quantity changes according to the standart unit times of operations which compose the packs. BIN and PACK NOTIONS

  9. GROUP CONCEPT Group is the bin/bins that is filled by pack or packs. If we consider a bin as a worker who has daily working time + overtime; a group consists of one or more workers. If the group consists of two or more workers,required time for each operation is distributed equally to these workers.

  10. THE MATERIAL Sewing department of garment company and trousers-skirt modal have chosen as material of the problem.

  11. THE METHOD • Line balancing is a planning problem and most of the planning problems are in NP-complete class.Bin Packing Problem (BPP) is also in NP-complete class. • BPPs are,in fact, the form of planning problem obtained by reversing them. • BPP’s solution principles has considered for the solution of line balancing problem.

  12. MATHEMATICAL MODAL OF THE PROBLEM and , ( 1 ) are operations’ required times ( std. unit time ); p is the production quantity and (T+t) is the maximum daily working time for a worker. ( 2 )

  13. In this case,the goal is to minimize total space in bins. • Operations have partial priority according to (1) ordering. • Another point is that capacities are flexible because of t variable. • Let’s call BPP, defined like this, as Prior Group Bin Packing Problem (PGBPP).

  14. ( 3 ) ( 4 ) ( 5 )

  15. ( 6 ) ( 7 ) ( 8 ) ( 9 )

  16. With these notations,mathematical modal for PGBPP becomes as follows; ( 10 ) ( 11 ) ( 12 ) ( 13 ) ( 14 ) ( 15 )

  17. In order to generate a synchronization between different cells ; the most ideal value for all cells is chosen from interval. For this value, is determined, then it is written in (5) and (10) formulas instead of . Thus,total idle time for determined assignment is assured. Here ; is a variable, is the suggested plan, is the flexibility constant and is the optimal solution.

  18. APPLICATION OF THE PROGRAM

More Related