Abstract
The job shop scheduling problem (JSSP) and the facility layout planning (FLP) are two important factors influencing productivity and cost-controlling activities in any manufacturing system. In the past, a number of attempts have been made to solve these stubborn problems. Although, these two problems are strongly interconnected and solution of one significantly impacts the performance of other, so far, these problems are solved independently. Also, the majority of studies on JSSPs assume that the transportation delays among machines are negligible. In this paper, we introduce a general method using multi-objective genetic algorithm for solving the integrated problems of the FLP and the JSSP considering transportation delay having three objectives to optimize: makespan, total material handling costs, and closeness rating score. The proposed method makes use of Pareto dominance relationship to optimize multiple objectives simultaneously and a set of non-dominated solutions are obtained providing additional degrees of freedom for the production manager.
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
Ripon, K.S.N., Siddique, N., Torresen, J.: Improved Precedence Preservation Crossover for Multi-Objective Job Shop Scheduling Problem. Evol. Syst. 2(2), 119–129 (2011)
Sarker, R., Ray, T., Fonseca, J.: An Evolutionary Algorithm for Machine Layout and Job Assignment Problems. In: 2007 IEEE Congress on Evolutionary Computation (CEC 2007), pp. 3991–3997 (2007)
Tompkins, A.: Facilities Planning, 2nd edn. John Wiley & Sons, New York (2003)
Ławrynowic, A.: A Survey of Evolutionary Algorithms for Production and Logistics Optimization. Res. Logist. 1(2), 57–91 (2011)
Drira, A., Pierreval, H., Hajri-Gabouj, S.: Facility Layout Problems: A Survey. Annu. Rev. Control. 31(2), 255–267 (2007)
Wang, L., Keshavarzmanesh, S., Feng, H.-Y.: A Hybrid Approach for Dynamic Assembly Shop Floor Layout. In: 2010 IEEE Conference on Automation Science and Engineering (CASE), pp. 604–609 (2010)
Aytug, H., Khouja, M., Vergara, F.E.: Use of Genetic Algorithms to Solve Production and Operations Management Problems: A Review. Int. J. Prod. Res. 41(17), 3955–4009 (2003)
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Grieco, A., Semeraro, Q., Tolio, T.: A Review of Different Approaches to the FMS Loading Problem. Int. J. Flex. Manuf. Sys. 13(4), 361–384 (2001)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA–II. IEEE T. Evolut. Comput. 6(2), 182–197 (2002)
Bierwirth, C.: A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms. OR Spectrum 17, 87–92 (1995)
Varela, R., Serrano, D., Sierra, M.: New Codification Schemas for Scheduling with Genetic Algorithms. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005, Part II. LNCS, vol. 3562, pp. 11–20. Springer, Heidelberg (2005)
Ripon, K.S.N., Glette, K., Mirmotahari, O., Høvin, M., Tørresen, J.: Pareto Optimal Based Evolutionary Approach for Solving Multi-Objective Facility Layout Problem. In: Leung, C.S., Lee, M., Chan, J.H. (eds.) ICONIP 2009, Part II. LNCS, vol. 5864, pp. 159–168. Springer, Heidelberg (2009)
Suresh, G., Vinod, V.V., Sahu, S.: A Genetic Algorithm for Facility Layout. Int. J. Prod. Res. 33(12), 3411–3423 (1995)
OR-Library, http://people.brunel.ac.uk/~mastjjb/jeb/info.html
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
Ripon, K.S.N., Glette, K., Hovin, M., Torresen, J. (2012). Job Shop Scheduling with Transportation Delays and Layout Planning in Manufacturing Systems: A Multi-objective Evolutionary Approach. In: Kamel, M., Karray, F., Hagras, H. (eds) Autonomous and Intelligent Systems. AIS 2012. Lecture Notes in Computer Science(), vol 7326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31368-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-31368-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31367-7
Online ISBN: 978-3-642-31368-4
eBook Packages: Computer ScienceComputer Science (R0)