• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.17-29
• /
• 1999

The manufacturing systems have to cope with the circumstance that the requirements of customers are changed abruptly and the life cycle of product becomes short. In this paper, to develop the efficient control and operation of autonomous, distributed machining systems the concept of Holonic Manufacturing System is adopted and methods for the control and operation of the system are proposed including an evaluation function for the negotiation between holons. And it is applied to scheduling and selection of operations to be worked with consideration of quality. It is expected that the proposed methods may be applied to operate autonomous, distributed machining systems.

• The Journal of Society for e-Business Studies
• /
• v.1 no.1
• /
• pp.227-247
• /
• 1996

Presented in this paper is a control model for developing virtual factory simulator, which is being operated under the distributed environment. The control model consists of production activity plan and information flows. To incorporate elements of the characteristics of the distributed control system, we suggested a collaboration model. This model is working under the client/server architecture, and also designed for cooperative-distributed shop control(CDSC) system in order to exploit several advantages of client/server architecture. Collaboration among each agent(or client) is done through negotiation and task sharing. Based on a contract net model, the CDSC system has three kinds of agents-order agent, resource agent, and communication forwarding agent. Each agent performs shop scheduling and control through negotiation on contract net. No node in CDSC system can have authority over other node. A bidding scheme is employed far negotiation between order agent and resource agents. The CDSC system can support re-negotiation among resource agents and an algorithm for re-negotiation is also developed. Experimental results are shown to advocate the effectiveness of the CDSC system for CIM environments.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.100-103
• /
• 1999

In this paper, a method for the efficient implementation of the PICNET network configurator for a distributed control system(DCS) is proposed. The network configurator is composed of the time parameter estimator and the period scheduler, the file generator. The main role of network configurator estimates time parameter, the pre-run time scheduling of the user input and make the period transmission table for operating the PICNET based distributed control system.

• 한국IT서비스학회:학술대회논문집
• /
• 2003.05a
• /
• pp.577-583
• /
• 2003

Due to the widespread availability of the internet, large-scale and dynamic distributed projects in industry are becoming popular. We present a distributed, collaborative, and adaptive control approach for decentralized multiple projects, which is one of representative project environments in modern e-enterprises. In this paper we deal with short term scheduling and rescheduling of resources, which are shared by multiple projects. We in specific, address the dynamic nature of the situation. We model this as a dynamic economy, where the multiple local markets are established and cleared over time trading resource time slots(goods). Local markets are modeled using a combinatorial auction mechanism. Due to the dynamic and distributed nature of economy, through our approach we can achieve higher levels of flexibility, scalability and adaptability.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.605-606
• /
• 2012

In this paper, we consider the problem of scheduling sensor activity to prolong the network lifetime while guaranteeing both discrete target coverage and connectivity among all the active sensors and the sink, called connected target coverage (CTC) problem. We proposed a distributed scheme called Distributed Lifetime-Maximizing Scheme (DLMS) to solve the CTC problem. Our proposed scheme significantly reduces the cost of the construction of the connected cover graphs in comparison with the some conventional schemes. In addition, the energy consumption is more balanced so that the network lifetime will be increased. Our simulation results show that DLMS scheme performs much better than the conventional schemes in terms of the network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1063-1070
• /
• 2015

In this paper, we propose a distributed user scheduling with transmit power control based on the amount of generating interference to other base stations (BSs) in multi-cell multi-input multi-output (MIMO) networks. Assuming that the time-division duplexing (TDD) system is used, the interference channel from users to other cell BSs is obtained at each user. In the proposed scheduling, each user first generates a transmit beamforming vector by using singular value decompositon (SVD) over MIMO channels and reduces the transmit power if its generating interference to other BSs is larger than a predetermined threshold. Each BS selects the user with the largest effective channel gains among users, which reflects the adjusted power of users. Simulation results show that the proposed technique significantly outperforms the existing user scheduling algorithms.

• The Journal of Engineering Research
• /
• v.6 no.1
• /
• pp.5-14
• /
• 2004

Finding a solution to a constraint satisfaction problem requires choosing values for variables so as to satisfy the constraints of the problem. A constraint is simply a logical relation among several unknowns (or variables), each taking a value in a given domain. Conventional constraint-based scheduling systems are not enough to satisfy the all constraints because there are conflicts between them. In this paper, we propose a method for interactive scheduling, which have two major problems: first, it is hard to satisfy concretely all various kinds of constraints, and second, the search space is extremely large and requires a long execution time. To solve the above problems, we introduce the Interactive Scheduling System (ISS) that interacts with the user to exchange suggestions each other. Our system is performed in two steps: knowledge base generation of an initial assignment and iterative improvement with the user(host or internet client) to satisfy the constraints. Applying our system, we actually constructed timetables for our university, where the scheduling time is considerably reduced.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.67-76
• /
• 2008

Grid computing has a large scale virtual computing environment that enables a collaborative processing through sharing resources of geographically distributed organizations. In recent year, the development of wireless networks and mobile devices enables mobile devices to consider as a resource of the grids. However, there are some problems such as low performance of processors, small capacity of storages, limited capacity of battery, and low bandwidth. In this paper, to overcome these limitations occurred in mobile grid environments, we proposed a proxy-based mobile grid system. Our proposed system enables mobile devices to play roles as a resource consumer and a resource provider and to collaborate with wired grids through a mobile router. Also, we propose an adaptive job scheduling scheme to cope with context changes of mobile devices and compare our scheduling scheme with other scheduling schemes using a simulation tool, SimGrid, to verify the validity of our job scheduling scheme.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.9-16
• /
• 2009

Because Grid system consists of heterogenous computing resources, which are distributed on a wide scale, it is impossible to efficiently execute applications with scheduling algorithms of a conventional parallel system that, in contrast, aim at homogeneous and controllable resources. To suggest an algorithm that can fully reflect the characteristics of a grid system, our research is focused on examining the type of information used in current scheduling algorithms and consequently, deriving factors that could develop algorithms further. The results from the analysis of these algorithms not only show that static information of resources such as capacity or the number of processors can facilitate the scheduling algorithms but also verified a decrease in efficiency in case of utilizing real time load information of resources due to the intrinsic characteristics of a grid system relatively long computing time, and the need for the means to evade unfeasible resources or ones with slow processing time. In this paper, we propose a new algorithm, which is revised to reflect static information in the logic of WQR(Workqueue Replication) algorithms and show that it provides better performance than the one used in the existing method through simulation.

• Journal of the Korea Society for Simulation
• /
• v.22 no.1
• /
• pp.77-86
• /
• 2013

Cloud computing is one of the distributed computing environments and utilizes several computing resources. Cloud environment uses a virtual machine to process a requested job. To balance a workload and process a job rapidly, cloud environment uses a provisioning technique and assigns a task with a status of virtual machine. However, a scheduling method for cloud computing requires a definition of virtual machine availabilities, which have an obscure meaning. In this paper, we propose Fuzzy logic driven Virtual machine Provisioning scheduling using Resource Evaluation(FVPRE). FVPRE analyzes a state of every virtual machine and actualizes a value of resource availability. Thus FVPRE provides an efficient provisioning scheduling with a precise evaluation of resource availability. FVPRE shows a high throughput and utilization for job processing on cloud environments.