Skip to main content
SpringerLink
Log in

Minimization of the Number of Employees in Manufacturing Cells

  • Conference paper
  • First Online:
International Joint Conference SOCO’18-CISIS’18-ICEUTE’18 (SOCO’18-CISIS’18-ICEUTE’18 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 771))

Abstract

In the paper we consider the problem of scheduling of technological operations implementation in productions cells in a company which produce steel structures of car seats. We propose an optimization algorithm based on the Branch and Bound method which determines minimal number of team members which operating production cells maintaining the maximum efficiency of the cells. The usefulness of the algorithm for practical purposes has been verified on real data.

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

Access this chapter

Log in via an institution
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. Bożejko, W., Gnatowski, A., Pempera, J., Wodecki, M.: Parallel tabu search for the cyclic job shop scheduling problem. Comput. Ind. Eng. 113, 512–524 (2017)

    Article  Google Scholar 

  2. Bożejko, W., Pempera, J., Wodecki, M.: A fine-grained parallel algorithm for the cyclic flexible job shop problem. Arch. Control Sci. 27, 169–181 (2017)

    Article  MathSciNet  Google Scholar 

  3. Bożejko, W., Gnatowski, A., Klempous, R., Affenzeller, M., Beham, A.: Cyclic scheduling of a robotic cell. In: Proceedings of 7th IEEE International Conference on Cognitive Infocommunications CogInfoCom 2016, 16–18 October, Wrocław, Poland, pp. 379–384 (2016)

    Google Scholar 

  4. Bożejko, W., Uchroński, M., Wodecki, M.: Parallel metaheuristics for the cyclic flow shop scheduling problem. Comput. Ind. Eng. 95, 156–163 (2016)

    Article  Google Scholar 

  5. Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)

    Article  Google Scholar 

  6. Che, A., Chu, C.: Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots. Eur. J. Oper. Res. 199(1), 77–88 (2009)

    Article  MathSciNet  Google Scholar 

  7. Drobouchevitch, I.G., Sethi, S.P., Sriskandarajah, C.: Scheduling dual gripper robotic cell: one-unit cycles. Eur. J. Oper. Res. 171(2), 598–631 (2006)

    Article  MathSciNet  Google Scholar 

  8. Grabowski, J., Pempera, J.: The permutation flow shop problem with blocking. A tabu search approach. Omega 35, 302–311 (2007)

    Article  Google Scholar 

  9. Levner, E., Kats, V., Levit, V.E.: An improved algorithm for cyclic flowshop scheduling in a robotic cell. Eur. J. Oper. Res. 97(3), 500–508 (1997)

    Article  Google Scholar 

  10. Pempera, J., Smutnicki, C.: Open shop cyclic scheduling. Eur. J. Oper. Res. 269, 773–781 (2018)

    Article  MathSciNet  Google Scholar 

  11. Ronconi, D.P.: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann. Oper. Res. 138, 53–65 (2005)

    Article  MathSciNet  Google Scholar 

  12. Ronconi, D.P.: A note on constructive heuristics for the flowshop problem with blocking. Int. J. Prod. Econ. 87, 39–48 (2004)

    Article  Google Scholar 

Download references

Acknowledgement

The paper was partially supported by the  National Science Centre of Poland, grant OPUS no. DEC 2017/25/B/ST7/02181.

Author information

Authors and Affiliations

  1. Faculty of Electronics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland

    Wojciech Bożejko, Jarosław Pempera & Mieczysław Wodecki

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jarosław Pempera
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko .

Editor information

Editors and Affiliations

  1. Computational Intelligence Group, University of the Basque Country, Sarriena, Vizcaya, Spain

    Manuel Graña

  2. Computational Intelligence Group, University of the Basque Country, Sarriena, Vizcaya, Spain

    José Manuel López-Guede

  3. Computational Intelligence Group, University of the Basque Country, Sarriena, Vizcaya, Spain

    Oier Etxaniz

  4. Department of Civil Engineering, University of Burgos, Burgos, Burgos, Spain

    Álvaro Herrero

  5. University of Salamanca, Salamanca, Salamanca, Spain

    José Antonio Sáez

  6. Department of Industrial Engineering, University of A Coruña, La Coruña, La Coruña, Spain

    Héctor Quintián

  7. University of Salamanca, Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bożejko, W., Pempera, J., Wodecki, M. (2019). Minimization of the Number of Employees in Manufacturing Cells. In: Graña, M., et al. International Joint Conference SOCO’18-CISIS’18-ICEUTE’18. SOCO’18-CISIS’18-ICEUTE’18 2018. Advances in Intelligent Systems and Computing, vol 771. Springer, Cham. https://doi.org/10.1007/978-3-319-94120-2_23

Download citation

Publish with us

Policies and ethics

Search

Navigation