• Title/Summary/Keyword: Flow Shop

Search Result 158, Processing Time 0.026 seconds

A Case-Study of Implementing Lean Production System in Manufacturing Electronic Components (전자부품 생산 Line에 있어서 Lean 생산방식 적용에 대한 실증적 고찰)

  • Lee, Sang-Cheon;Wang, Jung-Il
    • IE interfaces
    • /
    • v.12 no.3
    • /
    • pp.468-479
    • /
    • 1999
  • Lean production system can be defined as customer(product)-oriented production system with small lot size and flow-shop layout based on the JIT(Just-in-time) principles. In this paper, we introduce a case example of implementation of the Lean product ion system for manufacturing line of electronic component which has both machine processes and manual jobs. We also investigate the issues of implementing the Lean production system with the viewpoints of layout design scheme and JIT management rules. In the layout design, we propose the cell-line which has flow-shop layout with small lot size. In the management rules, the superior cell rule is applied in order to boost the needs of kaisen up. As the results of implementing the Lean production system, production lead time is decreased from 5 days to 1.5 days and also productivity and quality level arc surprisingly increased.

  • PDF

Dynamic Production Scheduling for JIT Delivery in a Welding Shop Adopting Batch-Production (뱃치생산을 하는 용접작업장에서 JIT 납품을 위한 동적생산일정계획)

  • Moon, Dug-Hee
    • IE interfaces
    • /
    • v.10 no.2
    • /
    • pp.57-67
    • /
    • 1997
  • This paper is a report of a simulation study that investigates a dynamic approach to scheduling jobs in a conventional shop floor, especially in an assemoly-type welding process. We consider both JIT arrival and JIT delivery. Various dispatching rules are tested for the following performance measures; mean flow time, rate of tardy jobs, mean tardiness, sum of mean tardiness and mean earliness. The results indicate that SPT rule is the best for the mean flow time. MSLACK that we suggest in this paper, is the best for the mean tardiness and the sum of mean tardiness and mean earliness. However, it is not clear that which rule is the best for the rate of tardy jobs.

  • PDF

A Scheduling Scheme for Flexible Flow Shop with Release Date and Due Date (시작시기와 납기를 고려하는 유연흐름공장의 일정계획)

  • Lee, J.H.;Kim, S.S.
    • IE interfaces
    • /
    • v.11 no.3
    • /
    • pp.1-13
    • /
    • 1998
  • This paper addresses a scheduling scheme for Flexible Flow Shop(FFS) in the case that a factory is a sub-plant of an electronic device manufacturing plant. Under this environment, job orders for the sub-plants in the production route are generated together with job processing time bucket when the customer places orders for final product. The processing time bucket for each job is a duration from possible release date to permissible due date. A sub-plant modeled FFS should schedule these jobs orders within time bucket. Viewing a Printed Circuit Board(PCB) assembly line as a FFS, the developed scheme schedules an incoming order along with the orders already placed on the scheduled. The scheme consists of the four steps, 1)assigning operation release date and due date to each work cells in the FFS, 2)job grouping, 3)dispatching and 4)machine allocation. Since the FFS scheduling problem is NP-complete, the logics used are heuristic. Using a real case, we tested the scheme and compared it with the John's algorithm and other dispatching rules.

  • PDF

Job Sequencing Problem for Three-Machine Flow Shop with Fuzzy Processing Times

  • Park, Seunghun;Chang, Inseong;Gen, Mitsuo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.139-157
    • /
    • 1993
  • This paper presents possibilistic job scheduling based on the membership function as an alternative to probabilistic job scheduling and illustrates a methodology for solving job sequencing problem which the opinions of experts greatly disagree in each processing time. Triangular fuzzy numbers are used to represent the processing times of experts. Here, the comparison method is based on the dominance property. The criteria for dominance are presented. By the dominance criteria, for each job, a mojor TFN and a minor TFN are selected and apessimistic sequence with mojor TFNs and an optimistic sequence with minor TFNs are computed. The three-machine flow shop problem is considered as an example to illustrate the approach.

  • PDF

COMPUTER AIDED SCHECULING MODEL OF MATERIALS HANDSLING IN CHEMICAL ANALYSIS FLOOR

  • Fujino, Yoshikazu;Motomatu, Hiroyoshi;Kurono, Shigeru
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.31-34
    • /
    • 1995
  • The automated chemical analysis shop floor are developed for the environmental pollution problems in our chemical analysis center. This shop floor have the several equipments include weight, pour, dry, heater, boiler, mixture, spectroscopy etc. And the material handling components are made up by the stored stack, conveyore, turntables, robot etc. Computer simulation has been an important tool for these complete design problem. We have designed the arangement of chemical equipments and material flow systems by using the simulator "AutoModII". "AutoMoII" is one of the advanced simulator, CAD-like drawing tools with a powerful, engineering oriented language to model control logic and material flow. The result is the modeling of the chemical analysis system in accurate, three dimensional detail. We could designed the set able layout and scheduling system by using the AutoMoII simulator. AutoMoII simulator.

  • PDF

Minimization of Inspection Cost in a BLU Inspection System Using a Steady-State Flow Analysis

  • Yang, Moon-Hee;Kim, Seung-Hyun
    • Management Science and Financial Engineering
    • /
    • v.15 no.2
    • /
    • pp.53-68
    • /
    • 2009
  • In this paper, we address a problem for minimizing the number of items inspected in a back-light-unit (BLU) inspection system, which includes a K-stage inspection system, a source inspection shop, and a re-inspection shop. In order to formulate our objective, we make a steady-state flow analysis between nodes (or shops), and derive the steady-state amount of flows between nodes and defective rates by solving a nonlinear balance equation. We provide an enumeration method for determining an optimal value of K which minimizes the number of items inspected. Our methodology could be applied and extended to similar situations with slight modification.

Preemptive Goal Programming Based Heuristic Methods for Reentrant Flow Shop Planning with Bi-Objective (재방문이 있는 흐름공정의 이종목적 계획을 위한 우선순위 목표계획법 기반의 휴리스틱 방법)

  • Cho, Hang-Min;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.3
    • /
    • pp.240-246
    • /
    • 2012
  • 논문은 병렬 설비로 이루어진 다수의 단계를 포함하는 재방문이 있는 혼합흐름공정의 계획 문제를 다룬다. 재방문작업에서 제품은 몇몇 공정을 여러 번 방문하게 되고 이로 인하여 재공의 혼잡과 장비의 유휴의 원인이 된다. 이 상황에서는 생산성과 고객 만족도를 향상 시키는 것이 중요한 이슈이다. 따라서 본 논문은 혼합흐름공정에서 스루풋을 최대화하고 지연된 고객 수요를 최소화하기 위해 우선순위 목표계획법 기반의 휴리스틱 방법들을 제안한다. 그리고 이 휴리스틱 방법은 이전 문헌에서 제시된 방법과 비교하여 성능을 비교하였다.

-Machining Route Selection with the Shop Flow Information Using Genetic Algorithm- (작업장 특성을 고려한 가공경로선정 문제의 유전알고리즘 접근)

  • 이규용;문치웅;김재균
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.54
    • /
    • pp.13-26
    • /
    • 2000
  • Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

  • PDF

Automatic Collection of Production Performance Data Based on Multi-Object Tracking Algorithms (다중 객체 추적 알고리즘을 이용한 가공품 흐름 정보 기반 생산 실적 데이터 자동 수집)

  • Lim, Hyuna;Oh, Seojeong;Son, Hyeongjun;Oh, Yosep
    • The Journal of Society for e-Business Studies
    • /
    • v.27 no.2
    • /
    • pp.205-218
    • /
    • 2022
  • Recently, digital transformation in manufacturing has been accelerating. It results in that the data collection technologies from the shop-floor is becoming important. These approaches focus primarily on obtaining specific manufacturing data using various sensors and communication technologies. In order to expand the channel of field data collection, this study proposes a method to automatically collect manufacturing data based on vision-based artificial intelligence. This is to analyze real-time image information with the object detection and tracking technologies and to obtain manufacturing data. The research team collects object motion information for each frame by applying YOLO (You Only Look Once) and DeepSORT as object detection and tracking algorithms. Thereafter, the motion information is converted into two pieces of manufacturing data (production performance and time) through post-processing. A dynamically moving factory model is created to obtain training data for deep learning. In addition, operating scenarios are proposed to reproduce the shop-floor situation in the real world. The operating scenario assumes a flow-shop consisting of six facilities. As a result of collecting manufacturing data according to the operating scenarios, the accuracy was 96.3%.

Design Plan for Department Store's Cosmetic Shop Application of S.I.P(Store Identity Program) (S.I.P(Store Identity Program)을 적용한 백화점 화장품매장 디자인 계획)

  • Lee, Ju-Hyeong
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2008.05a
    • /
    • pp.82-85
    • /
    • 2008
  • A cosmetic shop in a department store is the best place in Korea's cosmetic market flow that shows the total image of each brand. The present day departmental cosmetic shops are centered around global brands and comparative brand power is competing with a small number of local brands. It is a fact that not only regarding the brand power of local brands but also the space design of their shops are different than the global brands. And, influenced by a modern society, culture, economic surrounding, the customers are getting original and individual. Their individualistic life style is demanding a shop environment with new concept. Such a sale environment is not for just product sale and a place where exchange economy of sale occurs. It is requisite for communication where total marketing strategy Is used In an active way. We must acknowledge it as a symbolic place being the ultimate site of customer oriented exchange economy showing the image of both product and the company. The aim of this plan is to set up a sale environment that will enhance the brand awareness and product value. We intended to provide purchase comfort and visual effect to the customer simultaneously with an Increase in customer attention by putting in the appropriate design requisites as per the brand specialty and by the application of a distinguished S.I.P (Store Identity Program) for the shop.

  • PDF