• Title/Summary/Keyword: buffer constraint

Search Result 50, Processing Time 0.032 seconds

A Study on Scheduling Considering Delivery and Production Efficiency in the JIT Systems (적시생산시스템에서 납기와 생산효율성을 고려한 Scheduling)

  • Kim, Jung
    • Journal of Industrial Convergence
    • /
    • v.5 no.2
    • /
    • pp.21-32
    • /
    • 2007
  • This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

  • PDF

Solution of the Drum-Buffer-Rope Constraint Scheduling Problems incorporated by MRP/JIT - (MRP와 JIT에 부합하는 DBR 제약일정계획문제 해법)

  • 김진규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.59
    • /
    • pp.21-36
    • /
    • 2000
  • The drum-buffer-rope(DBR) system is a finite scheduling mechanism that balances the flow of the production system. DBR controls the flow of materials through the plant in order to produce products in accordance with market demand, with a minimum of manufacturing lead time, inventory, and operating expenses. This paper integrates the best of MRP push system and JIT pull system with DBR system, efficiently adapts these logics to capacity constraint resources, and contributes to the evolution of synchronous manufacturing. The purpose of this paper is, thus, threefold. The first objective is to identify the frame of theory of constraints(TOC) and the logic of DBR scheduling. The second objective is to formulate the DBR constraint scheduling problems(DBRCSP) in a job shop environments. Finally, the paper is to suggest the solution procedure of DBRCSP for embedding TOC into MRP/JIT along with an numerical expression. In addition, illustrative numerical example is given.

  • PDF

TOC를 이용한 업무프로세스 효율성 향상

  • 배혜림;이승현;조남욱
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2005.12a
    • /
    • pp.130-139
    • /
    • 2005
  • 본 논문은 BPM 시스템에 의해서 관리되는 비즈니스 프로세스의 효율성을 증대시키는 새로운 방법으로 TOC(Theory Of Constraint)이론에서 사용되는 DBR(Drum, Buffer, Rope) 개념을 적용한다. TOC이론은 주로 생산공정의 효율증대를 위한 방법론으로 인식되어 왔지만 비즈니스 프로세스에서도 적용이 되도록 BP-DBR (Business Process - DBR) 방법론을 개발한다. 또한 이를 통해 실제 금융권에서 사용되는 프로세스 효율성이 증대되는 것을 시뮬레이션 실험을 통해 보인다.

  • PDF

On the Size of the Constraint Buffer in the TOC(Theory of Constraints) (제약이론에서 제약버퍼의 크기 결정)

  • Koh, Shie-Gheun;Yoon, Hoon-Yong
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.334-340
    • /
    • 2001
  • The theory of constraints (TOC) has become a valuable system in modern operations management. Using the ideas and methods of the TOC, companies can achieve a large reduction of work-in-process and finished-goods inventories, significant improvement in scheduling performance, and substantial earnings increase. The purpose of this paper is to calculate the optimal size of the time buffer which is used to accommodate disruptions in production processes and provide maximum productivity of capacity constrained resources. After the problem formulation in terms of single server queueing model, we observed the system behavior by sensitivity analyses.

  • PDF

Optimal size of the constraint buffer in TOC (제약자원 버퍼의 최적 크기 결정)

  • Go Si Geun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.476-480
    • /
    • 2002
  • The theory of constraints (TOC) has become a valuable system in modern operations management. Using the ideas and methods of the TOC, companies can achieve a large reduction of work-in-process and finished-goods inventories, significant improvement in scheduling performance, and substantial earnings increase. The purpose of this paper is to calculate the optimal size of the time buffer which is used to accommodate disruptions in production processes and provide maximum productivity of capacity constrained resources. After the problem formulation in terms of single server queueing model, we observed the system behavior by sensitivity analyses.

  • PDF

Optimal buffer size control of serial production lines with quality inspection machines

  • Han, Man-Soo;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.350-353
    • /
    • 1996
  • In this paper, based on the performance analysis of serial production lines with quality inspection machines, we develope an buffer size optimization method to maximize the production rate. The total sum of buffer sizes are given and a constant, and under this constraint, using the linear approximation method, we suggest a closed form solution for the optimization problem with an acceptable error. Also, we show that the upstream and downstream buffers of the worst performance machine have a significant effect on the production rate. Finally, the suggested methods are validated by simulations.

  • PDF

The Buffer Allocation with Linear Resource Constraints in a Continuous Flow Line (자원제약조건을 갖는 연속흐름라인에서 Buffer 의 할당에 관한 연구)

  • Seong, Deok-Hyun;Chang, Soo-Young;Hong, Yu-Shin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.4
    • /
    • pp.541-553
    • /
    • 1995
  • An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.

  • PDF

Job Shop System Analysis through DBR Simulation (DBR 시뮬레이션을 통한 Job Shop 시스템 분석)

  • Shim, Yun-Seop;Byeon, Ji-Hwan;Hwang, Soon-Hyun;Jeon, Tae-Bo
    • Journal of Industrial Technology
    • /
    • v.31 no.B
    • /
    • pp.51-58
    • /
    • 2011
  • Simulation plays a pivotal role in the analysis of complex systems. In this study, a job shop manufacturing system has been analyzed through DBR (Drum-buffer-rope) simulation. Specific attention has been put to examine the rate of due-date achievement. We first derived key factors affecting the system performance. We then developed ARENA simulation program based on DBR of TOC (Theory of Constraints) concepts. Based on the performance measure, factors, and experimental design, we obtained the results. We have drawn meaningful results through examination of the results. The results obtained from this study may provide a good base for practical applications.

  • PDF

A Detailed Design for DBR Based APS System (DBR 기반의 APS 시스템 상세 설계)

  • Choi, Jeong-Gil;Kim, Su-Jin;Ju, Jeong-Min;Chung, Sun-Wha;Chung, Nam-Kee
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.348-355
    • /
    • 2001
  • This paper suggests a detailed design of APS(Advanced Planning & Scheduling) system using the DBR (Drum-Buffer-Rope) which is a finite capacity scheduling logic of TOC(Theory of Constraints). Our design is composed of four modules; Network, Buffer, Drum and Subordination. The Network module defines the Product Network which is built from BOM and routings. The Buffer module inserts the Buffers into the Product Network. The Drum module describes detail procedures to create Drum Schedule on the CCR(Capacity Constraint Resource). The Subordination module synchronizes all non-constraints to the constraints by determining the length of Rope. This design documented by ARIS.

  • PDF

A Study on Electronic Commerce in Supply Chain sing Drum-Buffer-Rope Scheduling (DBR 스케줄링을 이용한 공급체인에서의 전자 상거래 방안 연구)

  • 김효용;한영근
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.754-757
    • /
    • 2000
  • 인터넷을 이용한 사이버 거래가 빠른 속도로 증가함으로써 기업에게 있어 인터넷 쇼핑몰 구축은 더 이상 선택사항이 아닌 필수 사항이 되었다. 하지만 현재 사이버 거래 수준은 전통적 상거래 수준에 못 미칠뿐더러 거래 항목에 있어서도 매우 제한적인 것이 사실이다. 앞으로 사이버 거래는 계속적으로 증가하리라 전망되지만 제품의 특성 혹은 고객의 기호에 따라 전통적 상거래도 그 영역을 차지하며 함께 양립하여 발전할 것이다. 이에 본 연구에서는 기존의 상거래 시스템에 사이버 거래기능을 추가하는 모델을 제시한다. 먼저 지리적으로 멀리 떨어져 있는 유통망의 정보화를 위하여 인터넷 기술을 이용하고 공급체인(Supply Chain) 전체에 걸친 동기화를 위해 TOC(Theory of Constraint)의 DBR(Drum-Buffer-Rope) 스케줄링을 응용한다. 모든 생산 및 유통의 흐름 속도가 최종 분배 센타에 접수되는 고객의 요구에 따라 이루어지게 함으로써 공급체인 전체에 걸친 동기화를 이룰 수 있고 지속적인 버퍼 관리를 통하여서 재고의 절감은 물론 미출고의 발생도 최소화할 수 있다. 만약 분배 센타에 재고부족 현상이 일어날 경우에는 공급체인 상의 능력제약자원(Capacity Constraint Resource . CCR)을 찾아 개선 활동을 수행하며 공급체인의 흐름 속도를 능력제약자원에 맞추어 조절한다. 분배 센타에서 대리점 혹은 사이버 고객으로의 배송은 부분적 분할납품 Partial Transshipment : PT) 전략을 적용한다. 즉 각 분배 센타가 관리하는 수요지 중 인접한 지역을 부분적 분할납품 전략 적용 수요지로 선택하고 사이버 거래를 통해 생성된 물류가 부분적 분할납품 전략 적용 수요지에 분배되게 함으로써 각 분배 센타의 재고 완충역할을 수행하게 한다. 이에 따라 안전 재고 및 역 배송을 최소화 할 수 있을 뿐 아니라 미 출고로 인한 손실을 최소화하며 고객의 서비스를 일정하게 유지시킬 수 있을 것으로 기대된다.

  • PDF