Abstract
This paper describes the application of a metaheuristic to a real problem that arises within the domain of loads’ dispatch inside an automatic warehouse. The truck load operations on an automated storage and retrieval system warehouse could be modeled as a job shop scheduling problem with recirculation. The genetic algorithm is based on random key representation, that is very easy to implement and it allows the use of conventional genetic operators for combinatorial optimization problems. This genetic algorithm includes specific knowledge of the problem to improve its efficiency. A constructive algorithm based in Giffler-Thompson’s algorithm is used to generate non delay plans. The constructive algorithm reads the chromosome and decides which operation is scheduled next. This option increases the efficiency of the genetic algorithm. The algorithm was tested using some instances of the real problem and computational results are presented.
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
Hausman, W.H., Schwarz, L.B., Graves, S.C.: Optimal storage assignment in automatic warehousing systems. Management Science 22, 629–638 (1976)
Oliveira, J.A.: Aplicação de Modelos e Algoritmos de Investigação Operacional ao Planeamento de Operações em Armazéns. Ph.D. Thesis, Universidade do Minho, Braga, Portugal (2001)
Oliveira, J.A.: Scheduling the truckload operations in automatic warehouses. European Journal of Operational Research 179, 723–735 (2007)
Zhang, C., Li, P., Guan, Z., Rao, Y.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research 53, 313–320 (2007)
Liu, M., Hao, J., Wu, C.: A prediction based iterative decomposition algorithm for scheduling large-scale job shops. Mathematical and Computer Modelling 47, 411–421 (2008)
Laarhoven, P.J., Aarts, E., Lenstra, J.: Job shop scheduling by simulated annealing. Operations Research 40, 113–125 (1992)
Lian, Z., Gu, X., Jiao, B.: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation 183, 1008–1017 (2006)
Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms - I. representation. Computers & Industrial Engineering 30, 983–997 (1996)
Davis, L.: Job-shop scheduling with genetic algorithm. In: 1st International Conference on Genetic Algorithms and their Applications, pp. 136–140. Lawrence Erlbaum, Pittsburgh (1985)
Della Croce, F., Tadei, R., Volta, G.: A genetic algorithm for the job shop problem. Computers & Operations Research 22, 15–24 (1995)
Fang, H.L., Ross, P., Corne, D.: A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In: 5th International Conference on Genetic Algorithms, pp. 375–382. M. Kaufmann Publishers (1993)
Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research 35, 2892–2907 (2008)
Gonçalves, J.F., Mendes, J.J., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167, 77–95 (2005)
Oliveira, J.A.: A genetic algorithm with a quasi-local search for the job shop problem with recirculation. In: Applied Soft Computing Technologies: The Challenge of Complexity, pp. 221–234. Springer, Heidelberg (2006)
Park, B.J., Choi, H.R., Kim, H.S.: A hybrid genetic algorithm for the job shop scheduling problems. Computers & Industrial Engineering 45, 597–613 (2003)
Vaessens, R., Aarts, E., Lenstra, J.K.: Job Shop Scheduling by local search. INFORMS Journal on Computing 8, 302–317 (1996)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job-shop problem. Management Science 42, 797–813 (1996)
Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. Journal of Scheduling 8, 145–159 (2005)
Lin, T.L., Horng, S.J., Kao, T.W., Chen, Y.H., Run, R.S., Chen, R.J., Lai, J.L., Kuo, I.H.: An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Systems with Applications 37, 2629–2636 (2009)
Kimbrel, T., Sviridenko, M.: High-multiplicity cyclic job shop scheduling. Operations Research Letters 36, 574–578 (2008)
Yang, J., Sun, L., Lee, H.P., Qian, Y., Liang, Y.: Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems. Journal of Bionic Engineering 5, 111–119 (2008)
Oliveira, J.A., Dias, L., Pereira, G.: Solving the Job Shop Problem with a random keys genetic algorithm with instance parameters. In: Proceedings of 2nd International Conference on Engineering Optimization (EngOpt 2010), CDRom, Lisbon, Portugal (2010)
Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research 93, 1–33 (1996)
Jain, A.S., Meeran, S.: A state-of-the-art review of job-shop scheduling techniques. European Journal of Operations Research 113, 390–434 (1999)
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for Job Shop Scheduling. Management Science 34, 391–401 (1988)
Roy, B., Sussmann, B.: Les problemes d’ordonnancement avec constraintes disjonctives. Note DS, No. 9 Bis, SEMA, Paris (1964)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154–160 (1994)
Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Operations Research 8, 487–503 (1960)
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
Figueiredo, J., Oliveira, J.A., Dias, L., Pereira, G.A.B. (2012). A Genetic Algorithm for the Job Shop on an ASRS Warehouse. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31137-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-31137-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31136-9
Online ISBN: 978-3-642-31137-6
eBook Packages: Computer ScienceComputer Science (R0)