Abstract
In this work, an event-based genetic procedure for creating parameterized active schedules is proposed to solve the classical job shop scheduling, modelled as a continuous optimization problem. Instead of work with priorities values, the genetic algorithm defines values of delay times while the priorities are determined on the basis of the Last In First Out rule. The hypothesis is that any delay must end when the priority task arrives the machine. The scheduler is applied in a hybrid approach to solve the scheduling, which is a well-known NP-hard combinatorial optimization problem. After an initial schedule is created, it is refined by a local search and used as a seed in a final phase of optimization, in which a binary genetic indirect coding to induce permutations and generate new solutions is used. Preliminary results on a set of standard instances from literature validate the effectiveness of the proposed approach.
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
References
Akay, B., Yao, X.: Recent advances in evolutionary algorithms for job shop scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. Studies in Computational Intelligence, vol. 505, pp. 191–224. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39304-4_8
Asadzadeh, L.: A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput. Ind. Eng. 85, 376–383 (2015). https://doi.org/10.1016/j.cie.2015.04.006
Asadzadeh, L., Zamanifar, K.: An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Math. Comput. Model. (2010). https://doi.org/10.1016/j.mcm.2010.04.019
Beasley, J.: OR-Library (1990). http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files%0A/jobshop1.txt
Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A grasp for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics Operations. Research/Computer Science Interfaces Series, vol. 15, pp. 59–79. Springer, Boston (2002). https://doi.org/10.1007/978-1-4615-1507-4_3
Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551–591 (2016)
Gabel, T., Riedmiller, M.: Scaling adaptive agent-based reactive job-shop scheduling to large-scale problems. In: 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 259–266, April 2007. https://doi.org/10.1109/SCIS.2007.367699
Giffler, B., Thompson, G.L.: Algorithms for solving production-scheduling problems. Oper. Res. 8(4), 487–503 (1960)
Goncalves, J.F., Mendes, J.J.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77–95 (2005). https://doi.org/10.1016/j.ejor.2004.03.012
Grassi, F., Schimit, P.H.T., Pereira, F.H.: Dynamic seed genetic algorithm to solve job shop scheduling problems. In: Nääs, I., et al. (eds.) APMS 2016. IAICT, vol. 488, pp. 170–177. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-51133-7_21
Jain, A., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113(2), 390–434 (1999)
Jones, A., Rabelo, L.C., Sharawi, A.T.: Survey of Job Shop Scheduling Techniques. Wiley Encyclopedia of Electrical and Electronics Engineering. Wiley, London (2001)
Kelton, D.W.: Simulation with Arena. McGraw Hill, Boston (1998)
Kerzner, H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling, 10th edn. Wiley, Hoboken (2009)
Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O’Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 149–190. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-50137-6_7
van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992). https://doi.org/10.1287/opre.40.1.113
Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Ph.D. thesis, Graduate School of Industrial Administration, Carnegie-Mellon University (1984)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797–813 (1996). https://doi.org/10.2307/2634595
Ombuki, B.M., Ventresca, M.: Local search genetic algorithms for the job shop scheduling problem. Appl. Intell. 21(1), 99–109 (2004). https://doi.org/10.1023/B:APIN.0000027769.48098.91
Palacios, J.J., González-Rodríguez, I., Vela, C.R., Puente, J.: Robust swarm optimisation for fuzzy open shop scheduling. Nat. Comput. 13(2), 145–156 (2014)
Petrovic, D., Castro, E., Petrovic, S., Kapamara, T.: Radiotherapy scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. Studies in Computational Intelligence, vol. 505, pp. 155–189. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39304-4_7
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 4th edn. Springer, Boston (2012). https://doi.org/10.1007/978-1-4614-2361-4
Pongchairerks, P.: A self-tuning PSO for job-shop scheduling problems. Int. J. Oper. Res. 19(1), 96–113 (2014)
Pongchairerks, P.: Efficient local search algorithms for job-shop scheduling problems. Int. J. Math. Oper. Res. 9(2), 258–277 (2016)
Pongchairerks, P.: A two-level metaheuristic algorithm for the job-shop scheduling problem. Complexity 2019, 1–11 (2019)
Pongchairerks, P., Kachitvichyanukul, V., et al.: A two-level particle swarm optimisation algorithm on job-shop scheduling problems. Int. J. Oper. Res. 4(4), 390–411 (2009)
Sha, D., Hsu, C.Y.: A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35(10), 3243–3261 (2008)
Smutnicki, C., Bożejko, W.: Tabu search and solution space analyses. The job shop case. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2017. LNCS, vol. 10671, pp. 383–391. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-74718-7_46
Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Manag. Sci. 38(10), 1495–1509 (1992)
Wall, M.: GAlib: a C++ library of genetic algorithm components. Mechanical Engineering Department, Massachusetts Institute of Technology (1996). https://doi.org/citeulike-articleid:4305029. http://lancet.mit.edu/ga/dist/
Wang, L., Zheng, D.Z.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28(6), 585–596 (2001). https://doi.org/10.1016/S0305-0548(99)00137-9
Yamada, T.: Studies on metaheuristics for jobshop and flowshop scheduling problems. Ph.D. thesis, Kyoto University, Kyoto, Japan (2008)
Acknowledgement(s)
This work was partially supported by grant \(\#2018/08326-6\), São Paulo Research Foundation (FAPESP). Additionally, the authors would like to thank Universidade Nove de Julho for the support and the scholarship granted to the first two of them.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
dos Santos Júnior, L.C., Castello Rosa, A.d.F., Pereira, F.H. (2019). An Event-Based Parameterized Active Scheduler for Classical Job Shop Problem. In: Saeed, K., Chaki, R., Janev, V. (eds) Computer Information Systems and Industrial Management. CISIM 2019. Lecture Notes in Computer Science(), vol 11703. Springer, Cham. https://doi.org/10.1007/978-3-030-28957-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-030-28957-7_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-28956-0
Online ISBN: 978-3-030-28957-7
eBook Packages: Computer ScienceComputer Science (R0)