• Title/Summary/Keyword: Setup Planning

Search Result 144, Processing Time 0.028 seconds

An integrated process planning system through machine load using the genetic algorithm under NCPP (유전알고리즘을 적용한 NCPP기반의 기계선정 방법)

  • 최회련;김재관;노형민
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.612-615
    • /
    • 2002
  • The objective of this study is to develop an integrated process planning system which can flexibly cope with the status changes in a shop floor by utilizing the concept of Non-Linear and Closed-Loop Process Planning(NCPP). In this paper, Genetic Algorithm(GA) is employed in order to quickly generate feasible setup sequences for minimizing the makespan and tardiness under an NCPP. The genetic algorithm developed in this study for getting the machine load utilizes differentiated mutation rate and method in order to increase the chance to avoid a local optimum and to reach a global optimum. Also, it adopts a double gene structure for the sake of convenient modeling of the shop floor. The last step in this system is a simulation process which selects a proper process plan among alternative process plans.

  • PDF

A Research Survey and Prospect on the Medium-Range Production Planning Model (중기-생산계획 모형에 관한 연구현황 및 전망)

  • Kim Man-Su;Kim U-Yeol
    • Journal of the military operations research society of Korea
    • /
    • v.16 no.2
    • /
    • pp.151-167
    • /
    • 1990
  • Considerable research has concentrated on medium-range production planning model in that it can contain long and short-term decision making in contents. Since medium-range production planning deals in situations with setup time or/and costs, solution methodology is classified by (1) optimization method using a sort of integer programming approach and network formulation (2) heuristic method offering an computationally easy, approximate solution. But, solution methodology is different in type of demand generation, existence of capacity and dependant demand. Therefore this paper reviewed the medium range production planning according to above mentioned three factors, and suggested for further work direction.

  • PDF

Tire Industry and Its Manufacturing Configuration

  • Lee, Young-Sik;Cpim;Lee, Jin-Kyu
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.135-138
    • /
    • 2000
  • This paper is intended to propose what manufacturing configuration (manufacturing planning and shop floor control) is suitable for the tire industry. Basically tire-manufacturing process is mixed-products, parallel-disconnected-flow-shop. Both throughput time and cycle tine are very short, the variety of tires is very high, the setup time is long, shop floor data reporting requirements is high, and there are many equipments and people working. And with no exception, tire industry also now confronts increasing requirements of delivery conformance with the above peculiar characteristics of tire manufacturing and changing market environments, this paper suggests, weekly master scheduling with no MRP is desirable and traditional kanban is right selection for shop floor control/scheduling. This paper describes why this configuration should be, using the manufacturing engineering principles and some new insights like four primitives of parallel flow shop. Generally known that shop with high parallel-product-mix and long setup time isn't good candidate for kanban. The four primitives of parallel flow shop explain why kanban is also useful scheduling technique in that environment.

  • PDF

Daily Setup Uncertainties and Organ Motion Based on the Tomoimages in Prostatic Radiotherapy (전립선암 치료 시 Tomoimage에 기초한 Setup 오차에 관한 고찰)

  • Cho, Jeong-Hee;Lee, Sang-Kyu;Kim, Sei-Joon;Na, Soo-Kyung
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.19 no.2
    • /
    • pp.99-106
    • /
    • 2007
  • Purpose: The patient's position and anatomy during the treatment course little bit varies to some extend due to setup uncertainties and organ motions. These factors could affected to not only the dose coverage of the gross tumor but over dosage of normal tissue. Setup uncertainties and organ motions can be minimized by precise patient positioning and rigid immobilization device but some anatomical site such as prostate, the internal organ motion due to physiological processes are challenge. In planning procedure, the clinical target volume is a little bit enlarged to create a planning target volume that accounts for setup uncertainties and organ motion as well. These uncertainties lead to differences between the calculated dose by treatment planning system and the actually delivered dose. The purpose of this study was to evaluate the differences of interfractional displacement of organ and GTV based on the tomoimages. Materials and Methods: Over the course of 3 months, 3 patients, those who has applied rectal balloon, treated for prostatic cancer patient's tomoimage were studied. During the treatment sessions 26 tomoimages per patient, Total 76 tomoimages were collected. Tomoimage had been taken everyday after initial setup with lead marker attached on the patient's skin center to comparing with C-T simulation images. Tomoimage was taken after rectal balloon inflated with 60 cc of air for prostate gland immobilization for daily treatment just before treatment and it was used routinely in each case. The intrarectal balloon was inserted to a depth of 6 cm from the anal verge. MVCT image was taken with 5 mm slice thickness after the intrarectal balloon in place and inflated. For this study, lead balls are used to guide the registration between the MVCT and CT simulation images. There are three image fusion methods in the tomotherapy, bone technique, bone/tissue technique, and full image technique. We used all this 3 methods to analysis the setup errors. Initially, image fusions were based on the visual alignment of lead ball, CT anatomy and CT simulation contours and then the radiation therapist registered the MVCT images with the CT simulation images based on the bone based, rectal balloon based and GTV based respectively and registered image was compared with each others. The average and standard deviation of each X, Y, Z and rotation from the initial planning center was calculated for each patient. The image fusions were based on the visual alignment of lead ball, CT anatomy and CT simulation contours. Results: There was a significant difference in the mean variations of the rectal balloon among the methods. Statistical results based on the bone fusion shows that maximum x-direction shift was 8 mm and 4.2 mm to the y-direction. It was statistically significant (P=<0.0001) in balloon based fusion, maximum X and Y shift was 6 mm, 16mm respectively. One patient's result was more than 16 mm shift and that was derived from the rectal expansions due to the bowl gas and stool. GTV based fusion results ranging from 2.7 to 6.6 mm to the x-direction and 4.3$\sim$7.8 mm to the y-direction respectively. We have checked rotational error in this study but there are no significant differences among fusion methods and the result was 0.37$\pm$0.36 in bone based fusion and 0.34$\pm$0.38 in GTV based fusion.

  • PDF

An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix (원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법 모형 및 근사해 발견 기법(응용 부문))

  • Han, Jung-Hee;Lee, Young-Ho;Kim, Seong-In;Shim, Bo-Kyung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.127-133
    • /
    • 2006
  • Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product quality. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems. Also, we developed a web based scheduling and monitoring system for a zinc alloy production process using the developed heuristic algorithm. By using this system, we could find a monthly zinc alloy production schedule that significantly reduces the total number of setup changes.

  • PDF

A Process Planning System for Machining of Dies for Auto-Body Production(II)-Operation Planning and NC Code Post-Processing (자동차 차체금형 가공용 공정계획 시스템(II)-작업 계획과 NC 코드 후처리)

  • Sin, Dong-Mok;Lee, Chang-Ho;Choi, Jae-Jin;Noh, Sang-Do;Lee, Ki-Woo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.1
    • /
    • pp.63-73
    • /
    • 2001
  • This paper presents a process and operation planning system with an NC code post-processor for effective machining of press dies for production of cars. Based on the machining features, major parts of press dies are categorized into 15 groups and a standard process plan is defined for each group. The standard process plan consists of a series of processes where a process is defined as a group of operations that can be done with one setup. Details such as cutting tools, cutting conditions, and tool paths are decided at the operation planning stage. At the final stage of process and operation planning, the NC code post-processor we developed adjusts feedrates along the tool path to reduce machining time. The adjustment rule is selected based on the metal removal rate estimated by virtually machining with virtual cutting tool.

  • PDF

A Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem

  • Sun, Ji Ung
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.84-92
    • /
    • 2008
  • Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.

An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix (원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법 모형 및 근사해 발견 기법)

  • Lee, Young-Ho;Kim, Seong-In;Shim, Bo-Kyung;Han, Jung-Hee
    • Korean Management Science Review
    • /
    • v.24 no.1
    • /
    • pp.35-43
    • /
    • 2007
  • Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product qualify. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems.

A Single-Line Multi-Product Planning Problem Considering Inventory Interest Based on the Business Custom (상습관(商習慣)에 의한 재고금리(在庫金利)를 고려한 단일제조(單一製造)라인의 복수제품(複數製品) 생산계획(生産計劃))

  • Park, Seung-Heon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.13 no.1
    • /
    • pp.1-10
    • /
    • 1987
  • This paper deals with a single-facility multiproduct lot-size model requiring consideration of setup costs. Each product is demanded at the constant rate per unit time in the next particular period. Due to the limitation of the production capacity, some productions of total demand requirement in that period must be pre-produced. The aim of this project is to determine when and how much of each product to make in order to minimize the total setup costs and inventory carrying-costs of all products. Also this paper contains the further realistic treatment of inventory carrying-costs.

  • PDF