Skip to main content

The Concept of Genetic Algorithm Application for Scheduling Operations with Multi-resource Requirements

  • Conference paper
  • First Online:
15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020) (SOCO 2020)

Abstract

The paper presents the concept of a genetic algorithm for solving the problem of scheduling production processes, in which there are operations requiring the interaction of resources from at least two, different groups of competences. The considered system is based on flexible flow shop and the objective function is associated with minimizing the flow time of tasks. The general schedule generation procedure using the genetic algorithm is presented. Three sub-chromosomes are proposed for describing an individual. First of them represents a precedence feasible order of production tasks. Numbers of parallel machines are coded by the second sub-chromosome of the individual. Numbers of production employees able to execute operation on the set of parallel machines are coded by the third sub-chromosome. The order crossover and shift mutation procedures are described for the proposed chromosome differentiation and selection. Implementation of the developed concept enables parallel planning of positions and human resources (or any groups of resources) and improve practical usability in relation to hierarchical methods of resource planning.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zweben, M., Fox, M.S.: Intelligent Scheduling. Morgan Kaufman Publishers, Burlington (1994)

    Google Scholar 

  2. Pirlot, M.: General local search methods. Eur. J. Oper. Res. 92, 493–511 (1996)

    Article  Google Scholar 

  3. Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113, 390–434 (1999)

    Article  Google Scholar 

  4. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  5. Catrysse, D., Van Wassenhove, L.N.: A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60, 260–272 (1992)

    Article  Google Scholar 

  6. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  7. Van Laarhooven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job-shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992)

    Article  MathSciNet  Google Scholar 

  8. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    Book  Google Scholar 

  9. Laguna, M., Glover, F.: Integration target analysis and tabu search for improved scheduling systems. Exp. Syst. Appl. 6, 287–297 (1993)

    Article  Google Scholar 

  10. Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job-shop problem. Manag. Sci. 42(2), 797–813 (1996)

    Article  Google Scholar 

  11. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B Cybern. 26(1), 29–41 (1996)

    Article  Google Scholar 

  12. Blum, C.: Beam-ACO-hybridyzing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32(6), 1565–1591 (2005)

    Article  Google Scholar 

  13. Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constraint project scheduling. IEEE Trans. Evol. Comput. 6(4), 333–346 (2002)

    Article  Google Scholar 

  14. Shang, J., Tian, Y., Liu, Y., Liu, R.: Production scheduling optimization method based on hybrid particle swarm optimization algorithm. J. Intell. Fuzzy Syst. 34(2), 955–964 (2018)

    Article  Google Scholar 

  15. Tang, D., Zheng, K., Gu, W.: Hormone regulation based algorithms for production scheduling optimization. In: Adaptive Control of Bio-Inspired Manufacturing Systems, pp. 19–45. Springer, Singapore (2020)

    Google Scholar 

  16. Waschneck, B., Reichstaller, A., Belzner, L., Altenmüller, T., Bauernhansl, T., Knapp, A., Kyek, A.: Optimization of global production scheduling with deep reinforcement learning. Procedia CIRP 72(1), 1264–1269 (2018)

    Article  Google Scholar 

  17. Zhang, J., Ding, G., Zou, Y., Qin, S., Fu, J.. Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manuf. 30(4), 1809–1830 ((2019))

    Google Scholar 

  18. Wang, Z., Hu, H., Gong, J.: Modeling worker competence to advance precast production scheduling optimization. J. Constr. Eng. Manag. 144(11), 04018098 (2018)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Krzysztof Kalinowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Paprocka, I., Kalinowski, K., Balon, B. (2021). The Concept of Genetic Algorithm Application for Scheduling Operations with Multi-resource Requirements. In: Herrero, Á., Cambra, C., Urda, D., Sedano, J., Quintián, H., Corchado, E. (eds) 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). SOCO 2020. Advances in Intelligent Systems and Computing, vol 1268. Springer, Cham. https://doi.org/10.1007/978-3-030-57802-2_33

Download citation

Publish with us

Policies and ethics