• Title/Summary/Keyword: Multi-Stage Production System

Search Result 80, Processing Time 0.03 seconds

Definition of an Integrated Contract Package for Application of Multi-Trade Subcontract System (다공종 통합발주방식 적용을 위한 통합공종 규명에 관한 연구)

  • Song Hyung-Suk;Kim Kyoon-Tai;Han Choong-Hee;Kim Sun-Kuk
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.385-388
    • /
    • 2002
  • The construction industry has complicated production processes with diverse disciplines and subcontractors, which is the major cause of lowered productivity. To solve this problem, multi-trade subcontract system is recently suggested. Some general construction companies have applied this method to some sections of work process. However, this is in the early stage of application. The purpose of this study is to define an integrated contract package for improving both contractor and subcontractor efficiency. First, this study recognizes construction company to need of multi-trade subcontract system. Finally, it suggests feasible activities which can be useful for a construction company to apply to this subcontract system.

  • PDF

Hierarchical Flow Control in a Dynamic Multi-stage Manufacturing System (동적인 다단계 제조시스템에서의 계층적 흐름 통제 방법)

  • Ro, In-Kyu;Kim, Jin-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.1
    • /
    • pp.103-118
    • /
    • 1995
  • This paper is concerned with developing flow control method for a dynamic multistage manufacturing system with interstage buffers and unreliable machines. For the effective control of proposed manufacturing system, the three-level hierarchical scheme is introduced. At the top level, we collect the system data and then, design the buffer sizes and hedging points. Short-term production rates are calculated at the middle level. At the bottom level, actual dispatching times are determined by Clear the Largest Buffer Level rule. The control method utilizes the material and the space in the buffers to alleviate the propagation of a failure to other machines in the system and keeps the production close to demand. Finally, a numerical example is provided to illustrate the mathematical control method developed and implemented in a dynamic manufacturing environment.

  • PDF

Multi-Stage Group Scheduling with Dependent Setup Time (종속적(從屬的)인 준비시간을 갖는 다단계공정(多段階工程)에서의 그룹스케듈링 해법(解法))

  • Song, Yeong-U;No, In-Gyu;Kim, Man-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.11 no.2
    • /
    • pp.75-85
    • /
    • 1985
  • The application of GT results in the mass production effect to multi-product, small lot-sized production. Group scheduling, which is operations scheduling based on the GT concept, is analyzed in a multistage manufacturing system. But the research has been limited in independent setup time models. A heuristic algorithm has been developed to minimize the mean flow time when setup times are dependent to sequence of group in multistage. For evaluation of the heuristic algorithm, the solution of heuristic algorithm is compared with that of random scheduling. The result of comparison indicates that the proposed heuristic algorithm provides good solutions with relatively fewer computational effort.

  • PDF

생산제어시스템의 시뮬레이션모델 자동생성

  • 이상훈;조현보;정무영
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.631-634
    • /
    • 1996
  • This paper describes an intelligent user interface to define simulation models from the process and resource models. It also explains an automatic program generator of discrete event simulation model for shop floor control in a flexible manufacturing system. Especially, the paper is focused on the design and development of methodology to automate simulation modeling from the system description. Describing a shop floor control system in simulation is not an easy task since it must resolve various decision problems such as deadlock resolution, part dispatching, resource conflict resolution, etc. The program generator should be capable of constructing a complete discrete simulation models for a multi-product and multi-stage flow shop containing the above mentioned problems.

  • PDF

A Study on Operations in Single - Card KANBAN System with a General-Type-Structure Production Process (일반 형태의 생산구조 단일카드 KANBAN 시스템의 운영 최적화)

  • Kang, Suk-Ho;Ree, Sang-Bok
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.16 no.2
    • /
    • pp.109-117
    • /
    • 1990
  • In this paper we study a mathematical programming model for the single-card KANBAN system in a multi-stage capacitated general-type-structure production. Until now this production type setting has not been studied. The modeling of this problem results in a complex integer programming which can be modified to the more simple integer programming model. We present a heuristic method and some numerical examples. Though the presented method doesn't always find an optimal solution, this method guarantees to find a feasible solution. We expect this work to be practised in the real fields.

  • PDF

Performance Models of Multi-stage Bernoulli Lines with Multiple Product and Dedicated Buffers (다품종 제품과 전용 대기공간을 고려한 다단계 베르누이 라인을 위한 성능 모델)

  • Park, Kyungsu;Han, Jun-Hee;Kim, Woo-Sung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.3
    • /
    • pp.22-32
    • /
    • 2021
  • To meet rapidly changing market demands, manufacturers strive to increase both of productivity and diversity at the same time. As a part of those effort, they are applying flexible manufacturing systems that produce multiple types and/or options of products at a single production line. This paper studies such flexible manufacturing system with multiple types of products, multiple Bernoulli reliability machines and dedicated buffers between them for each of product types. As one of the prevalent control policies, priority based policy is applied at each machines to select the product to be processed. To analyze such system and its performance measures exactly, Markov chain models are applied. Because it is too complex to define all relative transient and its probabilities for each state, an algorithm to update transient state probability are introduced. Based on the steady state probability, some performance measures such as production rate, WIP-based measures, blocking probability and starvation probability are derived. Some system properties are also addressed. There is a property of non-conservation of flow, which means the product ratio at the input flow is not conserved at the succeeding flows. In addition, it is also found that increased buffer capacity does not guarantee improved production rate in this system.

A Study on the Systematic TV Drama Production System (방송드라마의 체계적 제작 시스템에 관한 연구)

  • Bae Jin-Ah
    • Journal of Game and Entertainment
    • /
    • v.2 no.2
    • /
    • pp.75-84
    • /
    • 2006
  • In terms of creating widespread popularity and a high value added business, TV drama is recognized as an unrivaled entertainment content above any other TV program genres Although recently some broadcasting companies have been trying to set up a drama production system, it seems that a well-structured system has not been established, yet. This study analyses the practices and mechanisms of drama producing processes based on the in-depth interviews with the experts in the drama production fields in three major broadcasting companies. It is found that the Korean drama production system is 'a producer-director system' and that the strategies for the windowing effects are not systematically applied from the pre-production stage. For the broadcasting companies to strengthen the competitiveness through drama, the expert-producer system should be introduced, the production elements should be systematically managed, and the multi-use strategies should be effectively established.

  • PDF

A Multi-agent System based on Genetic Algorithm for Integration Planning in a Supply Chain Management (유전 알고리즘에 기반한 동적 공급사슬 통합계획을 위한 멀티 에이전트 시스템)

  • Park, Byung-Joo;Choi, Hyung-Rim;Kang, Moo-Hong
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.3
    • /
    • pp.47-61
    • /
    • 2007
  • In SCM (supply chain management), companies are pursuing a new approach through which overall functions within the supply chain, ranging from material purchase to production, distribution, and sales are designed, planned, and managed in an integrated way. The core functions among them are production planning and distribution planning. As these problems are mutually related, they should be dealt with simultaneously in an integrated manner. SCM is large-scale and multi-stage problems. Also, its various kinds of internal or external factors can, at any time, dynamically bring a change to the existing plan or situation. Recently, many enterprises are moving toward an open architecture for integrating their activities with their suppliers, customers and other partners within the supply chain. Agent-based technology provides an effective approach in such environments. Multi-agent systems have been proven suitable to represent domains such as supply chain networks which involve interactions among manufacturing organization, their customers, suppliers, etc. with different individual goals and propriety information. In this paper, we propose a multi-agent system based on the genetic algorithm that make it possible to integrate the production and distribution planning on a real-time basis in SCM. The proposed genetic algorithm produced near optimal solution and we checked that there is a great difference in the results between integrated planning and non-integrated planning.

  • PDF

Multi-Dimensional Dynamic Programming Algorithm for Input Lot Formation in a Semiconductor Wafer Fabrication Facility (반도체 팹에서의 투입 로트 구성을 위한 다차원 동적계획 알고리듬)

  • Bang, June-Young;Lim, Seung-Kil;Kim, Jae-Gon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.73-80
    • /
    • 2016
  • This study focuses on the formation of input release lots in a semiconductor wafer fabrication facility. After the order-lot pegging process assigns lots in the fab to orders and calculates the required quantity of wafers for each product type to meet customers' orders, the decisions on the formation of input release lots should be made to minimize the production costs of the release lots. Since the number of lots being processed in the wafer fab directly is related to the productivity of the wafer fab, the input lot formation is crucial process to reduce the production costs as well as to improve the efficiency of the wafer fab. Here, the input lot formation occurs before every shift begins in the semiconductor wafer fab. When input quantities (of wafers) for product types are given from results of the order-lot pegging process, lots to be released into the wafer fab should be formed satisfying the lot size requirements. Here, the production cost of a homogeneous lot of the same type of product is less than that of a heterogeneous lot that will be split into the number of lots according to their product types after passing the branch point during the wafer fabrication process. Also, more production cost occurs if a lot becomes more heterogeneous. We developed a multi-dimensional dynamic programming algorithm for the input lot formation problem and showed how to apply the algorithm to solve the problem optimally with an example problem instance. It is necessary to reduce the number of states at each stage in the DP algorithm for practical use. Also, we can apply the proposed DP algorithm together with lot release rules such as CONWIP and UNIFORM.