Skip to main content

Agent-Based Shop Floor Scheduling

  • Conference paper
  • First Online:
Book cover Industrial Applications of Holonic and Multi-Agent Systems (HoloMAS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10444))

Abstract

Shop floor scheduling problem is known for a long time and is considered an academic exercise for solving by constraint solvers or for linear solvers. In a small production scale it can be solved easily. For a large scale production, the problem becomes too large and we need major heuristics to solve it. We introduce a way to decompose the major problem into smaller sub-problems and to quickly find a satisfying solution using human thinking inspired heuristics. The results combines scalable agent based solution and multiple constraint solver instances running in parallel.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Java Agent DEvelopmpent Framework. http://jade.tilab.com/

  2. Manne, A.S.: On the job shop scheduling problem. Oper. Res. 8(2), 219–223 (1960)

    Article  MathSciNet  Google Scholar 

  3. Zeballos, L.J., Quiroga, O.D., Henning, G.P.: A constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitations. Eng. Appl. Artif. Intell. 23(2), 229–248 (2010)

    Article  Google Scholar 

  4. McKay, K.N., Safayeni, F.R., Buzacott, J.A.: Job shop scheduling theory: What is relevant? Interfaces 18(4), 84–90 (1998)

    Article  Google Scholar 

  5. McFarlane, D., Sarma, S., Chirn, J.L., Wong, C.Y., Ashton, K.: The intelligent product in manufacturing control and management. In: 15th Triennial World Congress, Barcelona, Spain, July 2002

    Google Scholar 

  6. Morariu, C., Morariu, O., Borangiu, T.: Advanced shop-floor scheduling with genetic algorithm for combined horizon optimization in holonic manufacturing systems. In: Mařík, V., Lastra, J.L.M., Skobelev, P. (eds.) HoloMAS 2013. LNCS, vol. 8062, pp. 25–36. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40090-2_3

    Chapter  Google Scholar 

  7. Wang, C., Ghenniwa, H., Shen, W.: Real time distributed shop floor scheduling using an agent-based service-oriented architecture. Int. J. Prod. Res. 46(9), 2433–2452 (2008)

    Article  MATH  Google Scholar 

  8. Baker, A.D.: A survey of factory control algorithms which can be implemented in a multi-agent heterarchy: dispatching, scheduling, and pull. J. Manuf. Syst. 17(4), 297–320 (1998)

    Article  Google Scholar 

  9. Choco Constraint Solver Web Site (2017). http://www.choco-solver.org/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Klima .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Klima, M., Gregor, J., Harcuba, O., Marik, V. (2017). Agent-Based Shop Floor Scheduling. In: Mařík, V., Wahlster, W., Strasser, T., Kadera, P. (eds) Industrial Applications of Holonic and Multi-Agent Systems. HoloMAS 2017. Lecture Notes in Computer Science(), vol 10444. Springer, Cham. https://doi.org/10.1007/978-3-319-64635-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64635-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64634-3

  • Online ISBN: 978-3-319-64635-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics