Abstract
In this paper, an intelligent approach based on gene expression programming (GEP) is proposed to discover scheduling strategies for dynamic flexible job shop scheduling problem (DFJSP). In the approach, an indirect encoding and decoding scheme is designed in which the concept of automatically defined functions (ADF) is introduced. In the evaluation of the proposed GEP-based approach, simulation experiments are conducted with respect to the objective of minimizing mean tardiness. The results show that GEP-based approach can automatically find more efficient scheduling strategies for DFJSP under a big range of processing conditions.
Keywords
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., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. Eur. J. Oper. Res. 113, 390–434 (1998)
Ho, N., Tay, J., Lai, E.: An effective architecture for learning and evolving flexible job-shop schedules. Eur. J. Oper. Res. 179, 316–333 (2007)
Saidi-Mehrabad, M., Fattahi, P.: Flexible job shop scheduling with tabu search algorithms. Int. J. Adv. Manuf. Tech. 32, 563–570 (2007)
Zandieh, M., Mozaffari, E., Gholami, M.: A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. J. Intell. Manuf. 21, 731–743 (2010)
Zhang, G., Shao, X., Li, P., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56, 1309–1318 (2009)
Arnaout, J., Rabadi, G., Musa, R.: A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf. 21, 693–701 (2010)
Vieira, G., Hermann, J., Lin, E.: Rescheduling manufacturing systems: A framework of strategies, policies and methods. J. Scheduling 6, 39–62 (2003)
Aissani, N., Bekrar, A., Trentesaux, D., Beldjitali, B.: Dynamic scheduling for multi-site companies: A decisional approach based on reinforcement multi-agent learning. J. Intell. Manuf. (2011), doi:10.1007/s10845-011-0580-y
Dimopoulos, C., Zalzala, A.: Investigating the use of genetic programming for a classic one-machine scheduling problem. Adv. Eng. Softw. 32, 489–498 (2001)
Geiger, C., Uzsoy, R., Aytug, H.: Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. J. Scheduling 9, 7–34 (2006)
Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex System 13, 87–129 (2001)
Ferreira, C.: Discovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 50–59. Springer, Heidelberg (2002)
Zuo, J., Tang, C., Li, C., Yuan, C., Chen, A.: Time Series Prediction Based on Gene Expression Programming. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol. 3129, pp. 55–64. Springer, Heidelberg (2004)
Chen, Y., Tang, C., Zhu, J.: Clustering without Prior Knowledge Based on Gene Expression Programming. In: 3rd International Conference on Natural Computation, pp. 451–455 (2007)
Nie, L., Gao, L., Li, P., Zhang, L.: Application of gene expression programming on dynamic job shop scheduling problem. In: 15th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2011, pp. 291–295 (2011)
Nie, L., Gao, L., Li, P., Li, X.: A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J. Intell. Manuf. (2012), doi:10.1007/s10845-012-0626-9
Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35, 3202–3212 (2008)
Jackson, J.: Scheduling a Production Line to Minimize Maximum Tardiness. Research Report 43, Management Science Research Project, University of California at Los Angeles, Los Angeles, CA (1955)
Baker, K., Bertrand, J.: A dynamic priority rule for scheduling against due dates. J. Oper. Manag. 3, 37–42 (1982)
Panwalkar, S., Iskander, W.: A survey of scheduling rules. Oper. Res. 25, 45–46 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nie, L., Bai, Y., Wang, X., Liu, K. (2012). Discover Scheduling Strategies with Gene Expression Programming for Dynamic Flexible Job Shop Scheduling Problem. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-31020-1_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31019-5
Online ISBN: 978-3-642-31020-1
eBook Packages: Computer ScienceComputer Science (R0)