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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Xue, F., & Fan, W. (2007). Multi-agent optimization design for multi-resource job shop scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4682 LNAI, pp. 1193–1204). Springer Verlag. https://doi.org/10.1007/978-3-540-74205-0_123
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
