• 한국국방경영분석학회지
• /
• 제29권1호
• /
• pp.112-119
• /
• 2003

The procedure and implementation of an simulation based production planning and scheduling system. Production planning and scheduling is important problem in manufacturing field. It is so important for delivery quality as well as productivity, too. In this paper, heuristic production planning and scheduling module for improving delivery quality and productivity will be discussed. Beginning with total demand and initial work in process, the algorithms for production scheduling and planning can efficiently generate a feasible production resources and capacity schedule results in high resource utilization, minimum number of the late orders and reduced labor variability. The algorithm is executed to achieve the best on time delivery performance. The developed heuristic algorithms in the module will be expected to provide the better delivery performance and productivity.

• 한국인터넷방송통신학회논문지
• /
• 제23권1호
• /
• pp.139-144
• /
• 2023

최근 많은 제조 기업들이 에너지 비용과 환경 인식의 증가로 인해 에너지 효율에 더 많은 관심을 기울이고 있다. 생산 시스템의 에너지 효율적인 생산스케줄링은 생산에 필요한 에너지 효율을 개선하고 비용을 절감하는 효과적인 방법이다. 본 논문에서는 타이어 생산 문제를 상정하고, 일정한 종류와 형상 모듈 종류 및 각 타이어별 주문량, 생산 모듈의 개수 및 각 종류별 생산시간을 고려하여 생산스케줄링을 구축하는 것을 목표로 하였다. 효과적인 생산스케줄링에 용이하도록 현 상태에서 이용가능한 형상 모듈 종류 및 개수를 고려하여, 다음 단계에서 생산하기로 선택이 가능한 타이어 종류를 부가적인 입력으로 이용하였고, 주문량 이상의 추가 생산이 가능하도록 하였다. 그리하여 평균 62퍼센트 가량의 생산모듈 가동률을 얻었다.

• 한국국방경영분석학회지
• /
• 제24권2호
• /
• pp.162-169
• /
• 1998

This study presents an single machine scheduling algorithm minimize lateness of product by controlling machining speed. Generally, production scheduling uses the information of process planning. But the production scheduling algorithm has not considered the control of machining speed in its procedures. Therefore, the purpose of this study is to consider the machining speed in production scheduling algorithm for efficient production scheduling. Machining time and machining cost required to manufacture a piece of a product are expressed as a unimodal convex function with respect to machining speed, so it has minimal point at minimum time speed or the minimum cost speed. Therefore, because of considering the machining cost, the control of machining speed for the algorithm is executed between minimum speed and maximum speed. An example is demonstrated to explain the algorithm.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2000년도 추계학술대회 논문집
• /
• pp.28-33
• /
• 2000

This article describes the application of discrete event simulation in a process industry (coffee manufacturing) as a daily production-scheduling tool. A large number of end products (around 300), sporadic demand, and limited shelf life of coffee (90 days) make it difficult to generate feasible production schedules manually. To solve this problem an integrated system was developed incorporating discrete event simulation methodology into scheduling process. The integrated system is comprised of two components: a scheduling program and a simulation model. The scheduling program is used to generate daily schedules for roasting, grinding, and packing coffee. The simulation model uses the generated schedules to simulate the production of coffee and regenerates a modified production schedule. In this paper, each of the components will be described in detail, evaluated in terms of performance factors, and validated with a set of real production data. Although this article focuses on a specific system, we will share our experiences and intuitions gained and encourage other process industries to develop simulation-based scheduling tools.

• 시스템엔지니어링학술지
• /
• 제17권2호
• /
• pp.1-8
• /
• 2021

This study proposes a systems engineering approach for the development of an advanced planning & scheduling (APS) system for a cosmetic case manufacturing factory. The APS system makes production plans and schedules based on the injection process, which consists of 27 plastic injection machines in parallel to control recommended inventory of products. The system uses machine operation/failure information and defective product/work-in-process tracking information to support intelligent scheduling. Furthermore, a genetic algorithm model is applied to handle the complexity of heuristic rules and machine/quality constraints in this process. As a result of the development, the recommended inventory compliance rate is improved by scheduling the 30-day production plan for 15 main products.

• 산업경영시스템학회지
• /
• 제20권44호
• /
• pp.197-205
• /
• 1997

Manufacturers can meet the due dates of orders by using overtime, in which case, additional cost incurs for the amount of overtime. Although many studies have been reported on scheduling, only a few papers are founds on production scheduling using overtime. We consider the problem of production scheduling using overtime on a single machine, in which each job has a given due-date, a constant processing time. We assume that the daily overtime does not exceed the daily regular operation time. The objectives is to minimize the total overtimes, while meeting all due dates. We first present a mathematical model, and then suggest a heuristic algorithm for the problem.

• 산업경영시스템학회지
• /
• 제33권4호
• /
• pp.153-158
• /
• 2010

This study presents a single machine scheduling algorithm to minimize total cost(lateness cost, earliness cost and failure cost) by controlling machining speed. Generally, production scheduling uses the information of process planning and machining speed is not changed at production scheduling. And failure cost is not consider for scheduling algorithm. Therefore, the purpose of this study is to consider the change of machining speed for efficient production scheduling. And performance criteria for algorithm considers total cost. Especially, failure cost of product by increasing machining speed is considered.

• 산업공학
• /
• 제14권4호
• /
• pp.341-347
• /
• 2001

This paper describes a real-time manufacturing scheduling system on Internet using DBR(Drum-Buffer-Rope) scheduling method. We intend to change company-oriented manufacturing scheduling, which has been used at most manufacturing companies, to customer-oriented manufacturing scheduling. Customers can not only choose product kinds, quantities and order due dates, but also evaluate optimum order due date by themselves in real-time through internet and then the results will be converted into practical manufacturing scheduling. If the company cannot meet the customer order due date, it will offer reliable and accurate information to the customers by suggesting the earliest order due date. To evaluate the customer order due date in real time, companies should be able to estimate their accurate production capacity. This research uses Goldratt's DBR scheduling method to realize that function. The DBR scheduling does not recognize the production capacity of the whole company, but only of the constraint resources which have a great effect on the company throughput. Thus, it can improve the customer service level as well as the profit by performing more dynamic and reliable scheduling through Internet.

• 경영과학
• /
• 제21권2호
• /
• pp.79-91
• /
• 2004

In industrial production settings, scheduling problems for detailed day-to-day operations are often ordeals to production practitioners. For those who have scheduling experiences with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large scale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. In this paper, we Introduce the LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through a computer experiment in a hypothetical setting, we make a performance comparison of LSB scheduling algorithm with existing algorithms and also suggest a guideline for selecting the suitable algorithm for certain industrial settings.

• International Journal of Computer Science & Network Security
• /
• 제24권1호
• /
• pp.215-225
• /
• 2024

Predictive maintenance has been considered fundamental in the industrial applications in the last few years. It contributes to improve reliability, availability, and maintainability of the systems and to avoid breakdowns. These breakdowns could potentially lead to system shutdowns and to decrease the production efficiency of the manufacturing plants. The present article aims to study how predictive maintenance could be planed into the production scheduling, through a systematic review of literature. . The review includes the research articles published in international journals indexed in the Scopus database. 165 research articles were included in the search using #predictive maintenance# AND #production scheduling#. Press articles, conference and non-English papers are not considered in this study. After careful evaluation of each study for its purpose and scope, 50 research articles are selected for this review by following the 2020 Preferred Reporting Items for Systematic Review and Meta-Analysis Protocols (PRISMA) statement. A benchmarking of predictive maintenance methods was used to understand the parameters that contributed to improve the production scheduling. The results of the comparative analysis highlight that artificial intelligence is a promising tool to anticipate breakdowns. An additional impression of this study is that each equipment has its own parameters that have to be collected, monitored and analyzed.