• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.25
• /
• pp.23-31
• /
• 1992

This paper is concerned with an n jobs one machine Job shop scheduling problems in which all jobs have a common due date and unequal penalties occur when a job is completed before or after due date. The objective is to determine an optimal sequence and the corresponding common due date that yield the global minimum value of a penalty function Then a sequence that minimize the penalty function globally is a V-shaped sequence Using the idea of linear equations and a LGP(Linear Goal Programming), this paper shows that LGP and MAD(Mean Absolute Deviation) are equivalent problems. Therefore an efficient algorithm that is developed for MAD problem holds for LGP problem and vice-versa. A numerical example to account for the algorithm is provided.

• Journal of the Korean Society for Precision Engineering
• /
• v.31 no.7
• /
• pp.585-590
• /
• 2014

Recently, monitoring systems, such as POP, take a core role in scheduling or planning of manufacturing facilities for production, maintenance, and so on. Such monitoring systems require functionalities for real-time parameter monitoring and controlling to maximize efficiency of facilities. However, vendors usually do not provide internal communication protocols or interface to access the machine controller. Therefore, the values of parameters related to machine operations and controls cannot be easily accessed from external devices. In this paper, we propose an interface methodology for a real-time monitoring and controlling of injection molding machine parameters such as user input parameters, embedded sensor data and injection molding status information.

• International Journal of Precision Engineering and Manufacturing
• /
• v.4 no.2
• /
• pp.71-76
• /
• 2003

A virtual machine tool (VMT) is presented in this two-part paper. In Part 1, the analytical foundation for a virtual machining system is developed, which is envisioned as the foundation for a comprehensive simulation environment capable of predicting the outcome of cutting processes. The VHT system undergoes "pseudo-real machining", before actual cutting with a CNC machine tool takes place, to provide the proper cutting conditions for process planners and to compensate or control the machining process in terms of the productivity and attributes of the products. The attributes can be characterized by the machined surface error, dimensional accuracy, roughness, integrity, and so forth. The main components of the VMT are the cutting process, application, thermal behavior, and feed drive modules. In Part 1, the cutting process module is presented. When verified experimentally, the proposed models gave significantly better prediction results than any other methods. In Part 2 of this paper, the thermal behavior and feed drive modules are developed, and the models are integrated into a comprehensive software environment.vironment.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.11
• /
• pp.74-79
• /
• 2001

In this two-part paper, a virtual machine tool (VMT) is presented. In part 1, the analytical foundation of a virtual machining system, envisioned as the foundation for a comprehensive simulation environment capable of predicting the outcome of cutting processes, is developed. The VMT system purposes to experience the pseudo-real machining before real cutting with a CNC machine tool, to provide the proper cutting conditions for process planners, and to compensate or control the machining process in terms of the productivity and attributes of products. The attributes can be characterized with the machined surface error, dimensional accuracy, roughness, integrity and so forth. The main components of the VMT are cutting process, application, thermal behavior and feed drive modules. In part 1, the cutting process module is presented. The proposed models were verified experimentally and gave significantly better prediction results than any other method. The thermal behavior and feed drive modules are developed in part 2 paper. The developed models are integrated as a comprehensive software environment in part 2 paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.6
• /
• pp.512-520
• /
• 2013

In this paper, the control algorithm which can resolve the unfairness in network performance of the virtual machine arised from the CPU scheduling in cloud datacenter has been proposed. We first describe the evaluation and analysis results of the network unfairness phenomenon of virtual machine through the heterogeneous cloud datacenter testbed and we propose the control algorithm which can guarantee the fairness of the network performance based on the PID control scheme. Through the implementation and evaluation results, we verify the performance of the proposed algorithm.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.833-852
• /
• 2019

In real time applications, due to their effective cost and small size, wireless networks play an important role in receiving particular data and transmitting it to a base station for analysis, a process that can be easily deployed. Due to various internal and external factors, networks can change dynamically, which impacts the localisation of nodes, delays, routing mechanisms, geographical coverage, cross-layer design, the quality of links, fault detection, and quality of service, among others. Conventional methods were programmed, for static networks which made it difficult for networks to respond dynamically. Here, machine learning strategies can be applied for dynamic networks effecting self-learning and developing tools to react quickly and efficiently, with less human intervention and reprogramming. In this paper, we present a wireless networks survey based on different machine learning algorithms and network lifetime parameters, and include the advantages and drawbacks of such a system. Furthermore, we present learning algorithms and techniques for congestion, synchronisation, energy harvesting, and for scheduling mobile sinks. Finally, we present a statistical evaluation of the survey, the motive for choosing specific techniques to deal with wireless network problems, and a brief discussion on the challenges inherent in this area of research.

• The Journal of Society for e-Business Studies
• /
• v.25 no.2
• /
• pp.15-27
• /
• 2020

This study starts with the idea that the process of creating a Gantt Chart for schedule planning is similar to Tetris game with only a straight line. In Tetris games, the X axis is M machines and the Y axis is time. It is assumed that all types of orders can be worked without separation in all machines, but if the types of orders are different, setup cost will be incurred without delay. In this study, the game described above was named Gantris and the game environment was implemented. The AI-scheduling table through in-depth reinforcement learning compares the real-time scheduling table with the human-made game schedule. In the comparative study, the learning environment was studied in single order list learning environment and random order list learning environment. The two systems to be compared in this study are four machines (Machine)-two types of system (4M2T) and ten machines-six types of system (10M6T). As a performance indicator of the generated schedule, a weighted sum of setup cost, makespan and idle time in processing 100 orders were scheduled. As a result of the comparative study, in 4M2T system, regardless of the learning environment, the learned system generated schedule plan with better performance index than the experimenter. In the case of 10M6T system, the AI system generated a schedule of better performance indicators than the experimenter in a single learning environment, but showed a bad performance index than the experimenter in random learning environment. However, in comparing the number of job changes, the learning system showed better results than those of the 4M2T and 10M6T, showing excellent scheduling performance.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.96-100
• /
• 2004

In the ship building industry various problems of erection is counterfeited due to formation of bottle necks in the block erection flow pattern This kind of problems cause accumulated problems in real-time erection right on the floor, When such a problem is approached, a support data of the entire erection sequence should be available, Here planning is done by reasoning about the future events in order to verify the existence of a reasonable series of actions to accomplish a goal. This technique helps in achieving benefits like handling search complications, in resolving goal conflicts and anticipation of bottleneck formation well in advance to take necessary countermeasures and boosts the decision support system, The data is being evaluated and an anticipatory function is to be developed This function is quite relevant in day to day planning operation. The system updates database with rearrangement of off-critical blocks in the erection sequence diagram, As a result of such a system, planners can foresee months ahead and can effectively make decisions regarding the control of loads on the man, machine and work flow pattern, culminating to an efficient load management. Such a foreseeing concept helps us in eliminating backtracking related adjustment which is less efficient compared to the look-ahead concept. An attempt is made to develop a computer program to update the database of block arrangement pattern based on heuristic formulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.4
• /
• pp.116-122
• /
• 2013

This study develops a dynamic scheduling model for parallel machine scheduling problem based on genetic algorithm (GA). GA combined with discrete event simulation to minimize the makespan and verifies the effectiveness of the developed model. This research consists of two stages. In the first stage, work sequence will be generated using GA, and the second stage developed work schedule applied to a real work area to verify that it could be executed in real work environment and remove the overlapping work, which causes bottleneck and long lead time. If not, go back to the first stage and develop another schedule until satisfied. Small size problem was experimented and suggested a reasonable schedule within limited resources. As a result of this research, work efficiency is increased, cycle time is decreased, and due date is satisfied within existed resources.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.401-407
• /
• 2000

Modern microprocessors exploit instruction-level parallel processing to increase the performance. Especially VLIW processors supported by the parallelizing compiler are used more and more in specific applications such as high-end DSP and graphic processing. Bus-based VLIW architecture was proposed for these specific applications and it was designed to reduce the overhead of forwarding unit and the instruction width. In this paper, a optimizing scheduling compiler developed for the proposed bus-based VLIW processor is introduced. First, the method to model interconnections between buses and resource usage patterns is described. Then, on the basis of the modeling, machine-dependent optimization techniques such as bus-to-register promotion, copy coalescing and operand substitution were implemented. Optimization techniques for general-purpose VLIW microprocessors such as selective scheduling and enhanced pipelining scheduling(EPS) were also implemented. The experiment result shows about 20% performance gain for multimedia application benchmarks.