A Proposal of Web Application for the Study and Resolution of the Job Shop Problem with Makespan Minimization Via Mixed Integer Linear Programming

  • Conference paper
  • First Online:
Industrial Engineering and Operations Management (IJCIEOM 2023)

Abstract

This study proposes software that allows the user to solve the Job Shop Scheduling Problem (JSSP) with makespan minimization to support the teaching and learning of the JSSP, one of the main scheduling problems in the Operations Research literature. The application allows the user to enter instance data, solve it using four different mixed integer linear programming (MILP) models and evaluate the results in graphical form through an interactive Gantt chart and tabular form. The computational tool was developed in Python, using Streamlit, Pyomo, and GLPK as main libraries, and it can be accessed free via the internet. In addition, its source code is available for anyone to reproduce, redistribute and modify under the terms of the GPL v3.0. This work demonstrates the resolution of a 5 × 3 size problem through the four models available in the application, which observed four different optimal solutions. However, the performance of the disjunctive models is superior to the others in the execution time. Furthermore, it was found that the time-indexed model may not be useful in larger problems.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 279.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aguiar Júnior, J. C.: Modelo de arranjo linear e desigualdades válidas para o problema do job shop com minimização do makespan. Dissertação (mestrado) – Programa de Pós Graduação em Modelagem de Métodos Quantitativos. Universidade Federal do Ceará, Fortaleza (2021).

    Google Scholar 

  2. Arenales, M. et al: Pesquisa Operacional. Elsevier, Rio de Janeiro (2007).

    Google Scholar 

  3. Bynum, M. L. et al: Pyomo – Optimization modeling in Python. Springer International Publishing, Cham (2021).

    Book  Google Scholar 

  4. Eustace, S.: Poetry, https://pypi.org/project/poetry, last accessed 2022/10/11.

  5. Finley, T.: GLPK, https://pypi.org/project/glpk, last accessed 2022/10/11.

  6. Kondili, E., Pantelides, C. C., Sargent R. W. H.: A general algorithm for scheduling batch operations. In: PSE’88: Third International Symposium on Process System Engineering: In Affiliation with CHEMECA 88, a Bicentennial Event. Institution of Engineers, Sidney (1988).

    Google Scholar 

  7. Ku, W. Y., Beck, J. C.: Mixed integer programming models for job shop scheduling: A computational analysis. Computers & Operations Research, Elsevier BV, v.73, 165–173 (2016).

    Google Scholar 

  8. Liao, C. J., You, C. T.: An improved formulation for the job-shop scheduling problem. Journal of the Operational Research Society, Informa UK Limited, v.43, n.11, 1047–1054 (1992).

    Google Scholar 

  9. Manne, A. S.: On the job-shop scheduling problem. Operations Research, Institute for Operations Research and the Management Sciences (INFORMS), v.8, n.2, 219–223 (1960).

    Google Scholar 

  10. Python: A dynamic open-source programming language, https://www.python.org/, last accessed 2022/10/11.

  11. Streamlit, https://streamlit.io/, last accessed 2022/10/11.

  12. Wagner, H. M.: An integer linear programming model for machine scheduling. Naval Research Logistics Quarterly, Wiley, v.6, n.2, 131–140 (1959).

    Google Scholar 

  13. **ong, H. et al: A survey of job shop scheduling problem: The types and models. Computers & Operations Research, Elsevier BV, v.142, 105731 (2022).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

da Silva Júnior, A.C., Loch, G.V., dos Santos, M. (2023). A Proposal of Web Application for the Study and Resolution of the Job Shop Problem with Makespan Minimization Via Mixed Integer Linear Programming. In: Gonçalves dos Reis, J.C., Mendonça Freires, F.G., Vieira Junior, M. (eds) Industrial Engineering and Operations Management. IJCIEOM 2023. Springer Proceedings in Mathematics & Statistics, vol 431. Springer, Cham. https://doi.org/10.1007/978-3-031-47058-5_2

Download citation

Publish with us

Policies and ethics

Navigation