Multi-agent Optimization Design for Multi-resource Job Shop Scheduling Problems

Authors:
Fan Xue;Wei Fan
Affiliations:
College of Computer Science and Technology, Civil Aviation University of China, Tianjin 300300, P.R. China;College of Computer Science and Technology, Civil Aviation University of China, Tianjin 300300, P.R. China
Venue:
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Year:
2009

Citing 4
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Optimize cooperative agents with organization in distributed scheduling system

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a practical generalization of the job shop scheduling problem, multi-resource job shop scheduling problem (MRJSSP) is discussed in this paper. In this problem, operations may be processed by a type of resources and jobs have individual deadlines. How to design and optimize this problem with DSAFO, a novel multi-agent algorithm, is introduced in detail by a case study, including problem analysis, agent role specification, and parameter selection. Experimental results show the effectiveness and efficiency of designing and optimizing MRJSSPs with multi-agent.