• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.370-375
• /
• 2004

This paper presents an accurate cutting simulation and feedrate scheduling system for CNC machining. This system is composed of a cutting simulation part and a feedrate scheduling part. The cutting simulation part computes the geometric informations and calculates the cutting forces in CNC machining. The cutting force model using cutting-condition-independent coefficients was introduced for flat end milling and ball end milling. The feedrate scheduling part divides original blocks of NC code into smaller ones with optimized feedrates to adjust the peak value of cutting forces to reference forces. Some machining examples show that the developed system can control the cutting force at desired levels.

• IE interfaces
• /
• v.20 no.3
• /
• pp.277-287
• /
• 2007

Semiconductor manufacturing is one of the most complex and capital-intensive processes composed of several hundreds of operations. In today’s competitive business environments, it is more important than ever before to manage manufacturing process effectively to achieve better performances in terms of customer satisfaction and productivity than those of competitors. So, many semiconductor manufacturing companies implement advanced planning and scheduling (APS) system as a management tool for the complex semiconductor manufacturing process. In this study, we explain roles of production planning and scheduling in semiconductor manufacturing and principal factors that make the production planning and scheduling more difficult. We describe the APS system implementation project at Korean semiconductor manufacturing company in terms of key issues with realistic samples.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.67-73
• /
• 2000

This paper describes a scheduling support system for a plant where the machine environment may be modeled as non-identical parallel machine lines (NPML). That is, there are a number of stages in series with various different-capability-machines at each stage. Arriving continuously are jobs with their specific due dates, processing times and candidate processing machines. We’ve developed a real-time scheduling module in conjunction with a supporting production information system which supplies necessary data to the module. This scheduling module is one of the 9 modules in this system, and is composed of both a scheduling interface and a production monitoring interface. This module allows users to generate many candidate schedules by selecting their business policies. The selective arguments which are available consist of allocation costs, batch sizes and machine selection intervals. They are now being implemented at a powder metallurgy plant.

• IE interfaces
• /
• v.14 no.4
• /
• pp.394-402
• /
• 2001

In this study, we deal a spatial scheduling system for the block painting process in the shipbuilding industry. In general, the spatial scheduling for the block painting process is a very complicated task. Because spatial allocation of each block in blasting and painting cells is considered simultaneously. Thus the spatial scheduling for the block painting process is the problem of planning and control of operation, which arises in shipyard. This system is developed for blocks to meet the delivery date given by the shipyard production planning system, to maximize space utilization of blasting and painting cells and to balance workload among working teams. And it has been tested using actual scheduling data from a shipyard and successfully applied in a paint shop in a shipbuilding company.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.641-647
• /
• 2009

This paper proposes an improved predictive dynamic power management (DPM) scheme and a task scheduling algorithm to reduce unnecessary power consumption in embedded systems. The proposed algorithm performs pre-scheduling to minimize unnecessary power consumption. The proposed predictive DPM utilizes a scheduling library provided by the system to reduce computation overhead. Experimental results show that the proposed algorithm can reduce power consumption by 22.3% on the average comparing with the LLF algorithm for DPM-enable system scheduling.

• IE interfaces
• /
• v.10 no.3
• /
• pp.145-153
• /
• 1997

This paper deals with constructing a scheduling system for a mold manufacturing factory. The scheduling system is composed of 4 submodules such as pre-processor, neural network training, neural networks and simulation. Pre-processor analyzes the condition of workshop and generates input data to neural networks. Network training module is performed by using the condition of workshop, performance measures, and dispatching rules. Neural networks module presents the most optimized dispatching rule, based on previous training data according to the current condition of workshop. Simulation module predicts the earliest completion date of a mold by forward scheduling with the presented dispatching rules, and suggests a possible issue date of a material by backward tracking. The system developed shows a great potential when applied in real mold factory for automotive parts.

• Journal of Multimedia Information System
• /
• v.1 no.2
• /
• pp.95-100
• /
• 2014

Variable message signs (VMS) have the different sizes and a specific type according to the city scene and it has to be displayed by different message on the display panel in real-time. And VMS manufacturers must produce the different products in order to give a customized product to each order. In addition that, they should test and check the correct operation to each VMS product using the different message frame. That is very time and workers consuming and VMS emulator with an automatic variable message generator system is necessary. Also, the automatic message generator system is needed to real-time scheduling in order to display the message on the VMS panel like real world. In this paper, we design and implement the VMS emulator embedded the automatic message frame generator system with real-time scheduling which can set several parameters easily on the windows dialog.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.16
• /
• pp.19-26
• /
• 1987

Since many small and medium sized enterprises have lack of funds to install the full scale Computer Aided Process Planning this study has been attempted to develop a part of computer generated production information system for a start. The system is programmed by DBASE III and BASIC languages for the IBM-PC competables for the sake of user's convenience. The system consisted of four major parts. The first part is a computerized work measurement system for applying WF predetermined time standards. The second part is a computerized forecasting and loading system for applying various statistical techniques. The third part is a GT scheduling system programmed by BASIC for applying heuristic scheduling method. Finally, the last part is a simulation system for GT scheduling efficiency test which is programmed by SIMAN simulation language.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.25-35
• /
• 2005

The Rate Monotonic(RM) scheduling algorithm and Earliest Deadline First(EDF) scheduling algorithm are normally used in Real-Time scheduling algorithm. In those scheduling algorithm, we could predict the performance possibility with total utilization value of task group. But. it had problems with prediction of the boundedness in individual task when the utilization value was over in temporary task. In this paper, the suggested scheduling algorithm can predict task when the utilization value was over and it suggested the method of predicting scheduling possibility based on the utilization value of individual task as well. it predicted the boundedness of scheduling possibility test through simulation In Real-Time scheduling algorithm and analyzed the result.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.38
• /
• pp.139-146
• /
• 1996

In this thesis, we suggest the application of dock scheduling which is based on zero-one integer programming. A knowledge based system for dock scheduling was developed to implement this mathematical method.