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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jain, A.S., Meeran, S.: Deterministic Job-Shop Scheduling: Past, Present and Future. European Journal of Operational Research 113(2), 390–434 (1999)
Perregaard, M.: Branch and Bound Method for the Multiprocessor Jobshop and Flowshop Scheduling Problem. Master Thesis, Departement of Computer Science, University of Copenhagen, Danemark (1995)
Cesta, A., Oddi, A., Smith, S.F: Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: Proceedings of the Seventeenth National Conference on Artificial intelligence and Twelfth Conference on innovative Applications of Artificial intelligence (July 30 - August 03, 2000). AAAI Press / The MIT Press, pp. 742–747 (2000)
Nuijten, W.P.M., Aarts, E.H.L.: A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. European Journal of Operational Research 90(2), 269–284 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability - a Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Transactions on Knowledge and Data Engineering 10(5), 673–685 (1998)
Fan, W., Xue, F.: Optimize Cooperative Agents with Organization in Distributed Scheduling System. In: Huang, D.-S., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCS (LNAI), vol. 4114, pp. 502–509. Springer, Heidelberg (2006)
Xing, J., Liu, S., Fan, W., Ji, L.: Design of Airport Ground Service System Based on Multi-Agent. Journal of Civil Aviation University of China 24(3), 24–27 (2006) (in Chinese)
Stützle, T., Hoos, H.: The MAX-MIN Ant System and Local Search for The Traveling Salesman Problem. In: Proceedings of the Fourth International Conference on Evolutionary Computation (ICEC’97), pp. 308–313. IEEE Press, Los Alamitos (1997)
Stützle, T., Hoos, H.: Improvements on the Ant System: Introducing MAX–MIN Ant system. In: Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pp. 245–249. Springer, Wien (1997)
Fan, W., Zhang, G., Xue, F.: Design and Implementation of Airline Ground Services Mas Development Platform. In: Shi, C.Y., Shi, Z.Z., et al. (eds.) First Conference on Multi-agent Theory and Application, Yantai, China. Journal of Computer Research and Development, vol. 43 (s1), pp. 414–419 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, F., Fan, W. (2007). Multi-agent Optimization Design for Multi-resource Job Shop Scheduling Problems. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2007. Lecture Notes in Computer Science(), vol 4682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74205-0_123
Download citation
DOI: https://doi.org/10.1007/978-3-540-74205-0_123
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74201-2
Online ISBN: 978-3-540-74205-0
eBook Packages: Computer ScienceComputer Science (R0)