• Title/Summary/Keyword: Scheduling agents

Search Result 49, Processing Time 0.029 seconds

Design of a Coordinating Mechanism for Multi-Level Scheduling Systems in Supply Chain

  • Lee, Jung-Seung;Kim, Soo
    • Journal of Information Technology Applications and Management
    • /
    • v.19 no.1
    • /
    • pp.37-46
    • /
    • 2012
  • The scheduling problem of large products like ships, airplanes, space shuttles, assembled constructions, and automobiles is very complex in nature. To reduce inherent computational complexity, we often design scheduling systems that the original problem is decomposed into small sub-problems, which are scheduled independently and integrated into the original one. Moreover, the steep growth of communication technology and logistics makes it possible to produce a lot of multi-nation corporation by which products are produced across more than one plant. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. In this research, we suggest an agent-based coordinating mechanism for multi-level scheduling systems in supply chain. For design of a general coordination mechanism, at first, we propose a grammar to define individual scheduling agents which are responsible to their own plants, and a meta-level coordination agent which is engaged to supervise individual scheduling agents. Second, we suggest scheduling agent communication protocols for each scheduling agent topology which is classified according to the system architecture, existence of coordinator, and direction of coordination. We also suggest a scheduling agent communication language which consists of three layers : Agent Communication Layer, Scheduling Coordination Layer, Industry-specific Layer. Finally, in order to improve the efficiency of communication among scheduling agents we suggest a rough capacity coordination model which supports to monitor participating agents and analyze the status of them. With this coordination mechanism, we can easily model coordination processes of multiple scheduling systems. In the future, we will 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 experiment using the real-world data will be performed to examine this mechanism.

Agent-Based Scheduling for Semiconductor Wafer Fabrication Facilities (반도체 웨이퍼 팹의 에이전트 기반 스케쥴링 방법)

  • Yoon, Hyun Joong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.11 s.242
    • /
    • pp.1463-1471
    • /
    • 2005
  • This paper proposes an agent-based scheduling method fur semiconductor wafer fabrication facilities with hard inter-operation temporal constraints. The scheduling problem is to find the feasible schedules that guarantee both logical and temporal correctness. A proposed multi-agent based architecture is composed of scheduling agents, workcell agents, and machine agents. A scheduling agent computes optimal schedules through bidding mechanisms with a subset or entire set of the workcell agents. A dynamic planning-based approach is adopted for the scheduling mechanism so that the dynamic behaviors such as aperiodic job arrivals and reconfiguration can be taken into consideration.

A Study on Negotiation-based Scheduling using Intelligent Agents (지능형 이에전트를 이용한 협상 기반의 일정계획에 관한 연구)

  • 김성희;강무진
    • 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.

  • PDF

Multi-agent Negotiation System for Class Scheduling

  • Gwon Cheol Hyeon;Park Seong Ju
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.863-870
    • /
    • 2002
  • The current class scheduling has difficulties in reflecting students' preferences for the classes that they want to take and forecasting the demands of classes. Also, it is usually a repetitive and tedious work to allocate classes to limited time and cesourres Although many research studios in task allocation and meeting scheduling intend to solve similar problems, they have limitations to be directly applied to the class-scheduling problem. In this paper. a class scheduling system using multi agents-based negotiation is suggested. This system consists of student agents, professor agents and negotiation agents each agent arts in accordance with its respective human user's preference and performs the repetitive and tedious process instead of the user The suggested system utilizes negotiation cost concept to derive coalition in the agent's negotiation. The negotiation cost is derived from users' bidding prices on classes, where each biding price represents a user's preference on a selected class. The experiments were performed to verify the negotiation model in the scheduling system. The result of the experiment showed that it could produce a feasible scheduling solution minimizing the negotiation cost and reflecting the users' performance. The performance of the experiments was evaluated by a class success ratio.

  • PDF

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.

Identification of scheduling problems for CSCW-based shop floor control in agile manufacturing

  • Cha, Soohyun;Cho, Hyunbo;Jung, Mooyoung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.208-215
    • /
    • 1995
  • Numerous solution methods for scheduling problems such as part dispatching problem, operation sequence problem have been suggested as a means to be embedded in hierarchical or centralized shop floor control. Under the preceding control philosophies, however, response to changes in the shop floor status is quite slow and timely decision is sometimes impossible. Moreover, the control software becomes too large and it is almost impossible to modify the control software when the configuration of the shop floor changes. In agile manufacturing which emerged recently to cope with quick response and easy modifiability when unexpected changes occur, a new control policy is needed. CSCW[Computer Supported Cooperative Work] based shop floor control casts a different view on scheduling problems. Decisions are made locally when requested and useful information is scattered among agents for its efficient use. Adaptation is easy because agents are -'plug compatible or portable. In this paper, scheduling problems occurring under CSCW based shop floor control are identified and characterized. Traditional scheduling problems are reviewed from the CSCW viewpoint. All the control entities involved in the shop floor can be found and used to defined agents. With these entities and CSCW concept, possible scheduling problems are identified.

  • PDF

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.

Multiagent Scheduling of a Single Machine Under Public Information (공적 정보하에서 단일 설비의 다중 에이전트 스케줄링)

  • Lee, Yong-Kyu;Choi, Yoo-Seong;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.1
    • /
    • pp.72-78
    • /
    • 2009
  • This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

Deep Learning-Based Dynamic Scheduling with Multi-Agents Supporting Scalability in Edge Computing Environments (멀티 에이전트 에지 컴퓨팅 환경에서 확장성을 지원하는 딥러닝 기반 동적 스케줄링)

  • JongBeom Lim
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.12 no.9
    • /
    • pp.399-406
    • /
    • 2023
  • Cloud computing has been evolved to support edge computing architecture that combines fog management layer with edge servers. The main reason why it is received much attention is low communication latency for real-time IoT applications. At the same time, various cloud task scheduling techniques based on artificial intelligence have been proposed. Artificial intelligence-based cloud task scheduling techniques show better performance in comparison to existing methods, but it has relatively high scheduling time. In this paper, we propose a deep learning-based dynamic scheduling with multi-agents supporting scalability in edge computing environments. The proposed method shows low scheduling time than previous artificial intelligence-based scheduling techniques. To show the effectiveness of the proposed method, we compare the performance between previous and proposed methods in a scalable experimental environment. The results show that our method supports real-time IoT applications with low scheduling time, and shows better performance in terms of the number of completed cloud tasks in a scalable experimental environment.

A Study on Web Based Intelligent Tutoring System for Collaborative Learning : A Case of Scheduling Agents Systems for Figure Learning (협력학습을 위한 웹 기반 지능형 교수 시스템에 관한 연구 : 도형학습을 위한 스케줄링 에이전트 시스템을 중심으로)

  • 한선관;김세형;조근식
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 1999.10a
    • /
    • pp.269-279
    • /
    • 1999
  • 본 연구는 Web상에서 원격 협력 학습을 위한 수준별 학습자 모집 스케줄링 에이전트의 설계와 구현에 관해 제안한다. 본 시스템의 구조는 원격 교사 모듈과 여러 명의 학습자, 그리고 이를 연결해 주는 스케줄링 Agents, 학습자를 진단할 수 있는 진단 Agent로 구성된다. 컴퓨터가 분산환경으로 발전됨에 따라서 교육의 변화도 가속화되었고, 지식의 공유와 정보의 공유가 원격 협력학습에 의하여 절실히 필요하게 되었다. 원격 협력 학습에서의 학습자는 동일한 과목과 주제에 흥미를 느끼는 여러 명의 아동이 동시에 학습할 수 있는 상황이 필요하며, 선행 지식 또한 비슷한 수준이어야 동일한 주제로 학습의 효과가 있다. 이런 학습자를 판단하기 위해서 진단 Agent가 학습자를 진단하며 스케줄링 Agents의 학습자 지식에 추가한 후 스케줄링 Agents가 학습자의 기본 사항과 요구 내용을 추론하여 비슷한 수준의 학습자를 연결한다. 교사 모듈은 전통적인 ITS의 구조의 교수 학습 모듈, 전문가모듈로 구성되어 교수 학습을 할 수 있다. 이렇게 여러 명의 학습자를 연결하여 협력학습을 하기 위해서는 학습자간의 요구사항과 지식 수준 그리고 학습 가능한 시간이 같아야 하는데 이를 위해 시간을 자원으로 하는 동적 자원 스케줄링(Dynamic Resource Scheduling)으로 모델링 하였다. 본 연구에서 도형학습을 기반으로 하는 실험을 통해 구현한 원격 협력학습을 위한 지능형 스케줄링 에이전트를 평가하였다.

  • PDF