Abstract
Flexible job shop scheduling problem (fJSP) is an extension of the traditional job shop scheduling problem (JSP), which provides a closer approximation to real scheduling problems. In this paper, a multistage-based genetic algorithm with bottleneck shifting is developed for the fJSP problem. The genetic algorithm uses two vectors to represent each solution candidate of the fJSP problem. Phenotype-based crossover and mutation operators are proposed to adapt to the special chromosome structures and the characteristics of the problem. The bottleneck shifting works over two kinds of effective neighborhood, which use interchange of operation sequences and assignment of new machines for operations on the critical path. In order to strengthen the search ability, the neighborhood structure can be adjusted dynamically in the local search procedure. The performance of the proposed method is validated by numerical experiments on three representative problems.
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
Bruker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45, 369–375 (1990)
Chambers, J.B.: Classical and Flexible Job Shop Scheduling by Tabu Search. PhD thesis, University of Texas at Austin, Austin, U.S.A (1996)
Mastrolilli, M., Gambardella, L.M.: Effective neighborhood functions for the flexible job shop problem. J. Sched 3, 3–20 (2000)
Yang, J.-B.: GA-based discrete dynamic programming approach for scheduling in FMS environments. IEEE Trans. Systems, Man, and Cybernetics—Part B 31(5), 824–835 (2001)
Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Systems, Man, and Cybernetics—Part C 32(1), 1–13 (2002)
Wu, Z., Weng, M.X.: Multiagent scheduling method with earliness and tardiness objectives in flexible job shops. IEEE Trans. System, Man, and Cybernetics—Part B 35(2), 293–301 (2005)
Xia, W., Wu, Z.: An effective hybrid optimization approach for muti-objective flexible job-shop scheduling problem. Computers & Industrial Engineering 48, 409–425 (2005)
Zhang, H., Gen, M.: Multistage-based genetic algorithm for flexible job-shop scheduling problem. Journal of Complexity International 11, 223–232 (2005)
Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation. Computers & Industrial Engineering 30(4), 983–997 (1996)
Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Computers & Industrial Engineering 36(2), 343–364 (1999)
Gen, M., Zhang, H.: Effective Designing Chromosome for Optimizing Advanced Planning and Scheduling. In: Dagli, C.H., et al. (eds.) Intelligent Engineering Systems Through Artificial Neural Networks, vol. 16, pp. 61–66. ASME Press (2006)
Gao, J., Gen, M., Sun, L., Zhao, X.: A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Computers & Industrial Engineering 53(1), 149–162 (2007)
Gen, M., Cheng, R.: Genetic Algorithms & Engineering Optimization. Wiley, New York (2000)
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34(3), 391–401 (1998)
Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job shop scheduling. Management Science 44(2), 262–275 (1998)
Goncalves, J.F., Mendes, J.J.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167, 77–95 (2005)
Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation 60, 245–276 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gen, M., Gao, J., Lin, L. (2009). Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem. In: Gen, M., et al. Intelligent and Evolutionary Systems. Studies in Computational Intelligence, vol 187. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95978-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-95978-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95977-9
Online ISBN: 978-3-540-95978-6
eBook Packages: EngineeringEngineering (R0)