• Title/Summary/Keyword: Production Scheduling

Search Result 450, Processing Time 0.024 seconds

A Development of Web-based Inventory System using a RFID in Injection Molding Industry (RFID를 이용한 사출산업에서의 웹기반 재고관리시스템 개발)

  • Lim, Seok-Jin
    • Journal of the Korea Safety Management & Science
    • /
    • v.12 no.3
    • /
    • pp.177-182
    • /
    • 2010
  • Industrial business environments have rapidly changed and face severe competitive challenges. The effective inventory system enables to product and deliver the products quickly for meeting due date of customer's order in this environment. This study have developed a web-based inventory system using RFID for an injection molding industry. The system analysis inventory problem issues such as inventory planning, warehouse assignment and assist to develop production scheduling. In this study, web-based inventory system using Java language and RFID technology is proposed and implemented. As the result of implementation of the system, we expected that it manages to inventory planning continually and systematically.

A Real-Time Dispatching Algorithm for a Semiconductor Manufacture Process with Rework (재작업이 존재하는 반도체 제조공정을 위한 실시간 작업투입 알고리즘)

  • Shin, Hyun-Joon
    • Journal of the Semiconductor & Display Technology
    • /
    • v.10 no.1
    • /
    • pp.101-105
    • /
    • 2011
  • In case of high-tech process industries such as semiconductor and TFT-LCD manufactures, fault of a virtually finished product that is value-added one, since it has gone throughout the most of processes, may give rise to quality cost nearly amount to its selling price and can be a main cause that decreases the efficiency of manufacturing process. This paper proposes a real-time dispatching algorithm for semiconductor manufacturing process with rework. In order to evaluate the proposed algorithm, this paper examines the performance of the proposed method by comparing it with that of the existing dispatching algorithms, based on various experimental data.

An Auto Metrology Sampling Method Considering Quality and Productivity for Semiconductor Manufacturing Process (반도체 제조공정에서 품질과 생산성을 고려한 자동 계측 샘플링 방법)

  • Shin, Myung-Goo;Lee, Jee-Hyung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.9
    • /
    • pp.1330-1335
    • /
    • 2012
  • This paper proposes an automatic measurement sampling method for the semiconductor manufacturing process. The method recommends sampling rates using information of process capability indexes and production scheduling plan within the restricted metrology capacity. In addition, it automatically controls the measurement WIP (Work In Process) using measurement priority values to minimize the measurement risks and optimize the measurement capacity. The proposed sampling method minimizes measurement controls in the semiconductor manufacturing process and improves the fabrication productivity via reducing measurement TAT (Turn Around Time), while guaranteeing the level of process quality.

Hierarchical Control Scheme in Flexible Manufacturing Systems That have unreliable Machines and Maintenance (기계고장과 보전(保全)을 고려한 유연생산시스템의 계층적 통제계획)

  • Um, Wan-Sup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.4
    • /
    • pp.619-631
    • /
    • 1996
  • This paper describes an approach for the incorporation of maintenance times into a hierarchical scheduling for a failure prone flexible manufacturing system. The maintenance should not be performed too often because of the resulting reduction of capacity. Most manufacturing systems are large and complex. It is natural to divide the control into a hierarchy consisting of a number of different levels. Each level is characterized by the length of the planning horizon and the kind of data required for the decision making process. The goal of the analysis reported here is to calculate the production requirements while the machines fail and are repaired at random times. The machine failure and preventive maintenance are considered simultaneously.

  • PDF

Integrated Fleet Management Support System for Industrial Carrier (인더스트리얼 캐리어를 위한 통합 선대관리 지원시스템)

  • 김시화;허강이
    • Journal of the Korean Institute of Navigation
    • /
    • v.23 no.4
    • /
    • pp.63-76
    • /
    • 1999
  • This paper aims at developing an integrated fleet management support system for industrial carriers who usually control the vessels of their own or on a time charter to minimize the cost of shipping their cargoes. The work is mainly concerned with the operational management problem of the fleet owned by a major oil company, a typical industrial carrier. The optimal fleet management problem for the major oil company can be divided into two phase problem. The front end corresponds to the production operation problem of the transportation of crude oil, the refinery operation, and the distribution of product oil to comply with the demand of the market. The back end is to tackle the fleet scheduling problem to meet the seaborne transportation demand derived from the front end. Relevant optimization models for each phase are proposed and described briefly. Then a user-friendly integrated fleet management support system is built based on the proposed optimization models for both ends under Windows environment. A case study reflecting the practices of fleet management problem for the major oil company is carried out by using the system.

  • PDF

Development of a Scheduling System for Mould and Die Manufacturing Factory Using Microsoft Project 98 (Microsoft Project 98을 이용한 금형공장의 일정계획 시스템 개발)

  • Ju, Sang-Yoon;Ok, Kyung-Jin
    • IE interfaces
    • /
    • v.13 no.2
    • /
    • pp.246-252
    • /
    • 2000
  • As moulds and dies are manufactured through complex processes under the make-to-order production environment, it is very difficult that the manufacturing activities as like observance of the due date, trace of the progress, etc are controlled with a real time. In this paper, a schedule-planning system using the commercial software Microsoft Project 98 is developed to control the procedures of mould and die manufacturing with real time. Once an initial schedule is planned from the BOM information in the intranet, it is rescheduled by data collected from machines on the shop floor. The system is suitable to medium- or small-sized manufacturing companies as well as large-sized ones, because it can be installed with a low cost.

  • PDF

Problem Solution of Linear Programming based Neural Network

  • Son, Jun-Hyug;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2004.05a
    • /
    • pp.98-101
    • /
    • 2004
  • Linear Programming(LP) is the term used for defining a wide range of optimization problems in which the objective function to be minimized or maximized is linear in the unknown variables and the constraints are a combination of linear equalities and inequalities. LP problems occur in many real-life economic situations where profits are to be maximized or costs minimized with constraint limits on resources. While the simplex method introduced in a later reference can be used for hand solution of LP problems, computer use becomes necessary even for a small number of variables. Problems involving diet decisions, transportation, production and manufacturing, product mix, engineering limit analysis in design, airline scheduling, and so on are solved using computers. This technique is called Sequential Linear Programming (SLP). This paper describes LP's problems and solves a LP's problems using the neural networks.

  • PDF

Integrated Supply Chain Model of Advanced Planning and Scheduling (APS) and Efficient Purchasing for Make-To-Order Production (주문생산을 위한 APS 와 효율적 구매의 통합모델)

  • Jeong Chan Seok;Lee Young Hae
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.449-455
    • /
    • 2002
  • This paper considers that advanced planning and scheduling (APS) in manufacturing and the efficient purchasing where each customer order has its due date and multi-suppliers exit We present a Make-To­Order Supply Chan (MTOSC) model of efficient purchasing process from multi-suppliers and APS with outsourcing in a supply chain, which requires the absolute due date and minimized total cost. Our research has included two states. One is for efficient purchasing from suppliers: (a) selection of suppliers for required parts; (b) optimum part lead­time of selected suppliers. Supplier selection process has received considerable attention in the business­management literature. Determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions usually is complex and unstructured. These influence factors can be divided into quantitative and qualitative factors. In the first level, linguistic values are used to assess the ratings for the qualitative factors such as profitability, relationship closeness and quality. In the second level a MTOSC model determines the solutions (supplier selection and order quantity) by considering quantitative factors such as part unit price, supplier's lead-time, and storage cost, etc. The other is for APS: (a) selection of the best machine for each operation; (b) deciding sequence of operations; (c) picking out the operations to be outsourcing; and (d) minimizing makespan under the due date of each customer's order. To solve the model, a genetic algorithm (GA)-based heuristic approach is developed. From the numerical experiments, GA­based approach could efficiently solve the proposed model, and show the best process plan and schedule for all customers' orders.

  • PDF

An Integrated Maintenance in Injection Molding Processes (사출성형 공정에서의 통합정비방법에 관한 연구)

  • Park, Chulsoon;Moon, Dug Hee;Sung, Hongsuk;Song, Junyeop;Jung, Jongyun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.100-107
    • /
    • 2015
  • Recently as the manufacturers want competitiveness in dynamically changing environment, they are trying a lot of efforts to be efficient with their production systems, which may be achieved by diminishing unplanned operation stops. The operation stops and maintenance cost are known to be significantly decreased by adopting proper maintenance strategy. Therefore, the manufacturers were more getting interested in scheduling of exact maintenance scheduling to keep smooth operation and prevent unexpected stops. In this paper, we proposedan integrated maintenance approach in injection molding manufacturing line. It consists of predictive and preventive maintenance approach. The predictive maintenance uses the statistical process control technique with the real-time data and the preventive maintenance is based on the checking period of machine components or equipment. For the predictive maintenance approach, firstly, we identified components or equipment that are required maintenance, and then machine parameters that are related with the identified components or equipment. Second, we performed regression analysis to select the machine parameters that affect the quality of the manufactured products and are significant to the quality of the products. By this analysis, we can exclude the insignificant parameters from monitoring parameters and focus on the significant parameters. Third, we developed the statistical prediction models for the selected machine parameters. Current models include regression, exponential smoothing and so on. We used these models to decide abnormal patternand to schedule maintenance. Finally, for other components or equipment which is not covered by predictive approach, we adoptedpreventive maintenance approach. To show feasibility we developed an integrated maintenance support system in LabView Watchdog Agent and SQL Server environment and validated our proposed methodology with experimental data.

A Neighbor Selection Technique for Improving Efficiency of Local Search in Load Balancing Problems (부하평준화 문제에서 국지적 탐색의 효율향상을 위한 이웃해 선정 기법)

  • 강병호;조민숙;류광렬
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.2
    • /
    • pp.164-172
    • /
    • 2004
  • For a local search algorithm to find a bettor quality solution it is required to generate and evaluate a sufficiently large number of candidate solutions as neighbors at each iteration, demanding quite an amount of CPU time. This paper presents a method of selectively generating only good-looking candidate neighbors, so that the number of neighbors can be kept low to improve the efficiency of search. In our method, a newly generated candidate solution is probabilistically selected to become a neighbor based on the quality estimation determined heuristically by a very simple evaluation of the generated candidate. Experimental results on the problem of load balancing for production scheduling have shown that our candidate selection method outperforms other random or greedy selection methods in terms of solution quality given the same amount of CPU time.