• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.77-88
• /
• 2015

In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.348-352
• /
• 2000

Intelligent agents represent parts and manufacturing resources, which cooperate, negotiate, and compete with each other. The negotiation between agents is in general based on the Contract-Net-Protocol. This paper describes a new approach to negotiation-based job shop scheduling. The proposed method includes multi-negotiation strategy as well as single-negotiation. A case study showing the comparison of various negotiation strategies is also given.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3105-3112
• /
• 2000

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.283-290
• /
• 2016

As the development of recent science and technology, high-performance computing resources is needed to solve complex problems. To reach these requirements, it has been actively studied about grid computing that consist of a huge system which bind a heterogeneous high performance computing resources into on which are geographically dispersed. However, The current research situation which are the process to obtain the best results in the limited resources and the scheduling policy to accurately predict the total execution time of the real-time task are very poor. In this paper, in order to overcome these problems, we suggested a grid computing-based risk management system which derived from the system structure and the process for improving the efficiency of the system, grid computing-based working methodology, risk policy module which can manage efficiently the problem of the work of resources(Agent), scheduling technique and allocation method which can re-allocate the resource allocation and the resources in problem, and monitoring which can manage resources(Agent).

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.473-474
• /
• 2010

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.237-242
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. To cope with this problem, this paper deals with the development of an agent for selecting an optimal order set automatically. The main engine of selection agent is based on the typical job-shop scheduling model since our target domain is the injection molding company. To solve the problem, we have formulated it as IP (Integer Program) model, and it has been successfully implemented by ILOG and selection agent. And we have suggested an architecture of an agent for tackling web based order selection problems.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.393-397
• /
• 2001

This paper addresses an Intelligent Agent-based Open Architecture Cell Controller for Intelligent Manufacturing System(IMS). With an Intelligent Agent approach, the IMS will be a independent, autonomous, distributed system and achieve a adaptability to change of manufacturing environment. As the development methodology of Open Architecture Cell Controller, an object-oriented modeling technique is employed for building models associated with IMS operation, such as resource model, product model, and control model. Intelligent Agent-based Open Architecture Cell Controller consists of two kinds of dependant agents, that are the active agent and the coordinator agent. The Active agent is contributed to control components of IMS in real-time. The coordinator agent has great role in scheduling and planning of IMS. It communicates with other active agents to get information about status on system and generates the next optimal task through the making-decision logic and dispatch it to other active agent.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1046-1053
• /
• 2003

Recently various new model of teaching-learning as web based education system has been proposed. The demand for the customized courseware which is required from the learners is increased, the needs of the efficient and automated education agents in the web-based instruction are recognized. But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the teaming weakness which is observed in the continuous feedback of the course. In this paper we propose a multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm. First proposed system analyze learner's result of evaluation and calculates teaming accomplishment. From this accomplishment the multi-agent schedules the suitable course for the learner The learner achieves an active and complete learning from the repeated and suitable course.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.365-373
• /
• 2005

Ubiquitous learning environment needs various new model of e-learning as web based education system has been proposed. The demand for the customized courseware which is required from the learners is increased. the needs of the efficient and automated education agents in the web-based instruction are recognized. But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the learning weakness which is observed in the continuous feedback of the course. In this paper we propose a multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm via personalized ubiquitous environment factors. First proposed system analyze learner's result of evaluation and calculates learning accomplishment. From this accomplishment the multi-agent schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.