• Title/Summary/Keyword: 생산 일정계획

Search Result 233, Processing Time 0.031 seconds

Scheduling Generation Model on Parallel Machines with Due Date and Setup Cost Based on Deep Learning (납기와 작업준비비용을 고려한 병렬기계에서 딥러닝 기반의 일정계획 생성 모델)

  • Yoo, Woosik;Seo, Juhyeok;Lee, Donghoon;Kim, Dahee;Kim, Kwanho
    • The Journal of Society for e-Business Studies
    • /
    • v.24 no.3
    • /
    • pp.99-110
    • /
    • 2019
  • As the 4th industrial revolution progressing, manufacturers are trying to apply intelligent information technologies such as IoT(internet of things) and machine learning. In the semiconductor/LCD/tire manufacturing process, schedule plan that minimizes setup change and due date violation is very important in order to ensure efficient production. Therefore, in this paper, we suggest the deep learning based scheduling generation model minimizes setup change and due date violation in parallel machines. The proposed model learns patterns of minimizing setup change and due date violation depending on considered order using the amount of historical data. Therefore, the experiment results using three dataset depending on levels of the order list, the proposed model outperforms compared to priority rules.

A dispatching policy for stochastic scheduling simulation considering machine breakdowns (연구연속제조업 일정계획 문제에서 기계고장을 고려한 통계적 시뮬레이션 Dispatching 방법 연구)

  • Ko, Dong-Jin;Lee, Chul-Ung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.181-192
    • /
    • 2010
  • We develop a dispatching policy for stochastic scheduling simulation especially for a continuous manufacturing system with machine breakdowns. The proposed dispatching policy computes an urgency index with the consideration of re-heating, setup cost and remaining due date. Prioritized by the index, we execute swapping or reassigning material sequences so as to minimize the total penalty cost. To evaluate the performance of the proposed policy, a discrete event simulation is developed. With 200 data sets and 20 iterations, we compare the performance of the urgency policy with those of SPT (Shortest Processing Time) and FCFS (First Come First Serve) which are the most common policies. The result shows that the proposed policy consistently gives the lowest total costs by reducing the penalty costs for lateness.

Functional Analysis of Production Planning & Scheduling Solutions from SCM Perspective (공급망 관리 관점에서의 생산계획 솔루션 기능 분석)

  • Han, Kwan Hee
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.6
    • /
    • pp.564-573
    • /
    • 2018
  • External environment of enterprises are rapidly changing brought about mainly by global competition, cost and profitability pressures, and emerging new technology. In particular, frequent change of customer requirements is a tough challenge to manufacturing company. To cope with these challenges, a production planning and scheduling (PP&S) function might be established to provide accountability for both customer service and operational efficiency. PP&S deals with short-term decision making in the production process of whole supply chain. The task of PP&S is to seek a balance between customer orders and limited resources. At present, many PP&S software solutions have been utilized in many enterprises to generate a realistic production plan and schedule efficiently. The aim of this paper is to analyze the PP&S functionalities and its system architecture from the perspective of SCM (Supply Chain Management), and propose the PP&S solution classification framework to facilitate the comparison among various solutions.

Algorithms for Production Planning and Scheduling in an Assembly System Operating on a Make-to-Order Basis (주문생산방식을 따르는 조립시스템에서의 생산계획 및 일정계획을 위한 알고리듬)

  • Park, Moon-Won;Kim, Yeong-Dae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.3
    • /
    • pp.345-357
    • /
    • 1998
  • This paper focuses on production planning and scheduling problems in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problems, that is, tardiness is not allowed. Since the planning problem is a higher-level decision making than the scheduling problem, the scheduling problem is solved using a production plan obtained by solving the planning problem. We suggest heuristic procedures in which aggregated information is used when the production planning problem is solved while more detailed information is used when the scheduling problem is solved. Since a feasible schedule may not be obtained from a production plan, an iterative approach is employed in the two procedures to obtain a solution that is feasible for both the production planning and scheduling problems. Computational tests on randomly generated test problems are done to show the performance of these algorithms, and results are reported.

  • PDF

A Simulation Study on Capacity Planning in Hybrid Flowshops for Maximizing Throughput Under a Budget Constraint (혼합흐름공정에서 예산제약하에 생산율을 최대화하는 용량계획에 관한 시뮬레이션 연구)

  • Lee, Geun-Cheol;Choi, Seong-Hoon
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.3
    • /
    • pp.1-10
    • /
    • 2011
  • In this study, we consider a capacity planning problem where the number of machines at each workstation is determined in manufacturing systems of top-edge electronic products such as semiconductor or display. The considered manufacturing system is the typical hybrid flowshop which has identical parallel machines at each workstation and the setup operation occurs when the types of consecutively processed products are different. The objective of the problem is finding good combinations of the numbers of machines at all workstations, under the given capital amount for purchasing machines. Various heuristic methods for determining the numbers of machines at workstations are proposed and the performances were tested through a series of computational experiments. In the study, a simulation model has been developed in order to simulate the considered manufacturing system with dynamic orders and complex process. The simulation model is also used for conducting the computational comparison test among various proposed methods.

98년도 교육훈련계획 및 일정안내

  • 한국전력기술인협회
    • Electric Engineers Magazine
    • /
    • v.186 no.2
    • /
    • pp.8-18
    • /
    • 1998
  • IMF 한파로 인한 국내 경제적인 상황의 급격한 악화로 모든 생산활동이 위축되고 그에 따라 온국민은 물론 우리 전력기술인들이 처한 어려움도 예년에 비하여 가중되리라 생각합니다.

  • PDF

An Implementation of the B2B E-Marketplace Product Search Recomandation System using Business Rule (비즈니스 룰을 이용한 B2B E-Marketplace 제품 추천 시스템 구현)

  • Yu, Je-Seok;Jeong, Yeong-Il;Kim, Chang-Uk
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.300-309
    • /
    • 2005
  • 오늘날 B2B 전자상거래의 폭발적인 성장과 더불어 온라인 상에서 다수의 구매자와 공급자가 참여하여 다양한 형태의 거래를 수행하는 B2B e-Marketplace의 중요성이 부각되고 있다. 하지만 현재 B2B e-Marketplace 상황은 front-end 부분의 단순한 키워드 기반의 제품 카탈로그 검색만 제공할 뿐, 공급자의 재고상황, 생산 일정 그리고 제품의 배송 및 구매자에 따른 판매자의 정책 및 전략 등의 back-end 부분을 고려하지 않고 있다. 따라서 B2B e-Marketplace에서 주문처리와 배송 과정을 효율적으로 처리하기 위해서는, back-end 부분에서 구매자가 요구하는 제품들에 대하여 공급자의 생산계획과 수요예측, 재고처리, 수송 및 고객관리 등에 관한 정책을 실시간으로 정확하게 반영하고 처리할 수 있는 시스템이 필요하다. 본 논문에서는 이러한 문제점을 해결하기 위해 비즈니스 룰 시스템을 이용하여 공급자의 ATP와 CTP등의 생산계획과 비즈니스 정책을 실시간으로 반영하는 e-Marketplace 제품 추천 시스템을 제안하고 구현하였다. 본 논문은 공급자에게는 생산계획의 안정화, 납기 준수 율 제고의 효과를 제공하며, 구매자에게는 납기일의 불확실성을 제거함으로써 안정된 생산 및 판매계획 수립을 제공한다

  • PDF

은행 결제방법을 통하여 보는 북한의 기업관리

  • Jeon, Gyeong-Ju
    • KDI북한경제리뷰
    • /
    • v.23 no.9
    • /
    • pp.67-80
    • /
    • 2021
  • 북한은 최근 당중앙위원회 제8기 제3차 정치국 확대 회의에서 주민들에게 필요한 소비품의 생산을 늘리기 위해 경공업 공장들에 원자재들을 우선 보장하는 규율을 확립하고, 소비품 생산과 공급을 계획적으로 실속 있게 조직하여야 한다는 것에 대하여 언급하였다. 이것은 코로나19로 모든 무역활동이 중지된 상황에서 필수품의 생산을 늘려 이에 대한 내수시장을 일정 정도 확보하려는 의도로 해석된다. 본고에서는 원자재 구매, 생산과 판매 등 은행을 통한 북한의 기업관리에서 수요자와 공급자 간에 실질적으로 적용되는 다양한 결제방법을 계좌(돈자리) 개설, 제출 단위와 적용 근거, 해당 서류들을 따라가며 고찰함으로써 북한기업의 실질적 운영에 대한 구체적인 이해를 돕고자 한다. 자료로는 관련 도서와 문헌, 북한 관련법, 간행물 등을 참고하였다.