Abstract
To solve the double-objective optimization of dual resource constrained job shop scheduling, an inherited genetic algorithm is proposed. In the algorithm, evolutionary experience of parent population is inherited by the means of branch population supplement based on pheromones to accelerate the convergence rate. Meanwhile, the activable decoding algorithm based on comparison among time windows, the resource crossover operator and resource mutation operator, which are all established based on four-dimensional coding method are utilized with reference to the character of dual resource constrained to improve the overall searching ability. Furthermore, the championship selection strategy based on Pareto index weakens the impact of the Pareto level of chromosomes obviously. The elitist preservation strategy guarantees reliable convergence of the algorithm. Simulation results show that the performance of the proposed inherited GA is effective and efficient.
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
Nelson, R.T.: Labor and Machine Limited Production Systems. Management Science 13, 648–671 (1967)
Treleven, M.: A Review of the Dual Resource Constrained System Research. IIE Transactions 21, 279–287 (1989)
Kher, H.V.: Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments. Computers & Operations Research 27, 525–537 (2000)
Berman, O., Larson, R.C.: A queueing control model for retail services having back room operations and cross-trained workers. Computers & Operations Research 31, 201–222 (2004)
Treleven, M.: The Timing of Labor Transfers In Dual Resource-Constrained Systems: ”Push” Vs. ”Pull” Rules*. Decision Sciences 18, 73–88 (1987)
Salum, L., Araz: Using the when/where rules in dual resource constrained systems for a hybrid push-pull control. International Journal of Production Research 47, 1661–1677 (2009)
ElMaraghy, H., et al.: Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms. Journal of Manufacturing Systems 19, 186–201 (2000)
Zhijun, S., et al.: Intelligent optimization for job shop scheduling of dual-resources. Journal of Southeast University (Natural Science Edition) 35, 376–381 (2005)
Shujuan, L., et al.: Mix optimization scheduling approach for multi-resource job-shop. Journal of System Engineering 22, 551–555 (2007)
Binghai, Z., et al.: Scheduling Algorithm ofFlexible Production System Based on Dual Resource. Journal of South China University of Technolog 36, 45–49 (2008)
Zhigang, L., et al.: Multi-resource constrained job-shop optimization scheduling based on ant colony algorithm. Journal of System Simulation 19, 216–220 (2007)
Dorigo, M.: Optimization, learning and natural algorithms [in Italian], PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Milan (1992)
Huang, K.-L., Liao, C.-J.: Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research 35, 1030–1046 (2008)
Huang, R.-H.: Multi-objective job-shop scheduling with lot-splitting production. International Journal of Production Economics 124, 206–213 (2010)
Dussutour, A., et al.: Optimal traffic organization in ants under crowded conditions. Nature 428, 70–73 (2004)
Deb, K., et al.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 182–197 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jingyao, L., Shudong, S., Yuan, H., Ganggang, N. (2010). Research on Double-Objective Optimal Scheduling Algorithm for Dual Resource Constrained Job Shop. In: Wang, F.L., Deng, H., Gao, Y., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2010. Lecture Notes in Computer Science(), vol 6319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16530-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-16530-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16529-0
Online ISBN: 978-3-642-16530-6
eBook Packages: Computer ScienceComputer Science (R0)