• Title/Summary/Keyword: Two-Agent Scheduling

Search Result 10, Processing Time 0.026 seconds

Two-Agent Scheduling with Sequence-Dependent Exponential Learning Effects Consideration (처리순서기반 지수함수 학습효과를 고려한 2-에이전트 스케줄링)

  • Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.4
    • /
    • pp.130-137
    • /
    • 2013
  • In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, where two agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimize the total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B, representing the makespan of jobs for agent B. By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-based backward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problem has various applications in production systems as well as in operations management.

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Just-in-time Scheduling with Multiple Competing Agents (다수의 경쟁이 존재하는 환경에서 적시 스케줄링에 관한 연구)

  • Chung, Dae-Young;Choi, Byung-Cheon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.1
    • /
    • pp.19-28
    • /
    • 2012
  • We consider a multi-agent scheduling problem such that each agent tries to maximize the weighted number of just-in-time jobs. Two objectives are considered : the first is to find the optimal solution for one agent with constraints on the other agents' weight functions, and the second is to find the largest set of efficient schedules of which corresponding objective vectors are different for the case with identical weights. We show that when the number of agents is fixed, the single machine case with the first objective is NP-hard in the ordinary sense, and present the polynomial- time algorithm for the two-machine flow shop case with the second objective and identical weights.

Two-Agent Single-Machine Scheduling with Linear Job-Dependent Position-Based Learning Effects (작업 종속 및 위치기반 선형학습효과를 갖는 2-에이전트 단일기계 스케줄링)

  • Choi, Jin Young
    • 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.

Simulated Annealing for Two-Agent Scheduling Problem with Exponential Job-Dependent Position-Based Learning Effects (작업별 위치기반 지수학습 효과를 갖는 2-에이전트 스케줄링 문제를 위한 시뮬레이티드 어닐링)

  • Choi, Jin Young
    • 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.

Agent-based control systemfordistributed control of AGVs (AGV의 분산제어를 위한 에이전트 기반의 제어시스템)

  • O, Seung-Jin;Jeong, Mu-Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.1117-1123
    • /
    • 2005
  • This paper deals with a new automated guided vehicle (AGV) control system for distributed control. Proposed AGV control system adapts the multi-agent technology. The system is composed of two types of controller: routing and order. The order controller is in charge of assignment of orders to AGVs. Through the bidding-based negotiation with routing controllers, the order controller assigns a new order to the proper AGV. The order controller announces order information to the routing controllers. Then the routing controllers generate a routing schedule for the order and make a bid according to the routing schedule. If the routing schedule conflicts with other AGV's one, the routing controller makes an alternative through negotiation with other routing controllers. The order controller finally evaluates bids and selects one. Each controller consists of a set of agents: negotiation agent, decision making agent and communication agent. We focus on the agent architecture and negotiation-based AGV scheduling algorithm. Proposed system is validated through an exemplary scenario.

  • PDF

Intelligent Agent-based Open Architecture Cell Controller (지능에이전트를 이용한 개방형 셀 제어기 개발)

  • 황지현;최경현;이석희
    • 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.

  • PDF

A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo (최적 화물 선적을 위한 화주 에이전트 기반의 협상방법론)

  • Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Cho Jae-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.1
    • /
    • pp.75-93
    • /
    • 2006
  • The ship selection by consignors has two steps to carry their cargo. The first step is to select according to time schedule of ships and amount of cargo, and the second one is re-selection by concentrating different consignors' cargo into a unit that can be carried by single ship. Up to now, these steps are usually done by hands leading to inefficiency. The purpose of our paper is to form a logistics chain to minimize the overall sum of logistics cost by selecting ships for consignors' cargo using negotiation methodology between agents. Through concentration and distribution of cargo, maximization of global profit derived from searching optimal point in trade-off between inventory cost and freight rate cost. It is settled by the negotiation between consignors. In the experiments, two methods of the first-step of ship selection: EPDS(Earliest Possible Departure-Date Scheduling) and LPDS(Latest Possible Departure-Date Scheduling) coupled with the second-step ship concentration method using the negotiation were shown. From this, we deduced inventory cost, freight rates and logistics cost according SBF(Scheduling Bundle Factor) and analyzed the result. We found it will minimize the total logistics cost if we use negotiation method with EPDS.

  • PDF

A Simulation Method For Virtual Situations Through Seamless Integration Of Independent Events Via Autonomous And Independent Agents

  • Park, Jong Hee;Choi, Jun Seong
    • International Journal of Contents
    • /
    • v.14 no.3
    • /
    • pp.7-16
    • /
    • 2018
  • The extent and depth of the event plan determines the scope of pedagogical experience in situations and consequently the quality of immersive learning based on our simulated world. In contrast to planning in conventional narrative-based systems mainly pursuing dramatic interests, planning in virtual world-based pedagogical systems strive to provide realistic experiences in immersed situations. Instead of story plot comprising predetermined situations, our inter-event planning method aims at simulating diverse situations that each involve multiple events coupled via their associated agents' conditions and meaningful associations between events occurring in a background world. The specific techniques to realize our planning method include, two-phase planning based on inter-event search and intra-event decomposition (down to the animated action level); autonomous and independent agents to behave proactively with their own belief and planning capability; full-blown background world to be used as the comprehensive stage for all events to occur in; coupling events via realistic association types including deontic associations as well as conventional causality; separation of agents from event roles; temporal scheduling; and parallel and concurrent event progression mechanism. Combining all these techniques, diverse exogenous events can be derived and seamlessly (i.e., semantically meaningfully) integrated with the original event to form a wide scope of situations providing chances of abundant pedagogical experiences. For effective implementation of plan execution, we devise an execution scheme based on multiple priority queues, particularly to realize concurrent progression of many simultaneous events to simulate its corresponding reality. Specific execution mechanisms include modeling an action in terms of its component motions, adjustability of priority for agent across different events, and concurrent and parallel execution method for multiple actions and its expansion for multiple events.

Task Allocation and Scheduling of Multiagent Systems with Fuzzy Task Processing Times (퍼지 작업처리시간을 갖는 다중 에이전트 시스템의 작업할당 및 작업 스케쥴링)

  • Lee, Keon Myung;Lee, Kyung Mi
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.3
    • /
    • pp.324-329
    • /
    • 2004
  • This paper presents a coordination method to allocate and schedule tasks for multiagent systems of which agents have fuzzy processing time for their operations earlier on and their processing times are determined at the time the task operations are carried out later on. The proposed method is organized in a two-level genetic algorithm in which the upper level genetic algorithm plays the role of finding efficient task allocation and the lower level genetic algorithm takes charge of searching for efficient schedules corresponding to the task allocation proposed by the upper level genetic algorithm. It presents a strategy to deal with agent failures in the considered multiagent system. It also shows some experiment results for the proposed method.