Skip to main content
SpringerLink
Log in

Multi-actor Architecture for Schedule Optimisation Based on Lagrangian Relaxation

  • Conference paper
  • First Online:
Multiagent System Technologies (MATES 2016)

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

Included in the following conference series:

Abstract

In this paper an actor based approach to manufacturing scheduling is presented. It is based on a mathematical foundation, where the scheduling problem is formulated as an integer program. With lagrangian relaxation the problem is decomposed in independent sub-problems. The sub-problems can be solved concurrently, thus the mathematical foundation lends itself to a distributed computational architecture. The presented approach is discussed in the context of other distributed approaches in general and holonic manufacturing approaches in particular. The formal foundation and the computational architecture allowing its implementation are discussed.

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 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. Archimede, B., Letouzey, A., Memon, M.A., Xu, J.: Towards a distributed multi-agent framework for shared resources scheduling. J. Intell. Manuf. 25(5), 1077–1087 (2013). http://dx.doi.org/10.1007/s10845-013-0748-8

    Article  Google Scholar 

  2. Barbosa, J., Leitão, P., Adam, E., Trentesaux, D.: Self-organized holonic multi-agent manufacturing system: the behavioural perspective. In: 2013 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 3829–3834, October 2013

    Google Scholar 

  3. Behnke, D., Geiger, M.J.: Test instances for the flexible job shop scheduling problem with work centers (2012). http://edoc.sub.uni-hamburg.de/hsu/volltexte/2012/2982/

  4. Bragin, M.A., Luh, P.B., Yan, J.H., Yu, N., Stern, G.A.: Convergence of the surrogate Lagrangian relaxation method. J. Optim. Theory Appl. 164(1), 173–201 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Buil, R., Piera, M.A., Luh, P.B.: Improvement of Lagrangian relaxation convergence for production scheduling. IEEE Trans. Autom. Sci. Eng. 9(1), 137–147 (2012)

    Article  Google Scholar 

  6. Chen, H., Chu, C., Proth, J.M.: An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method. IEEE Trans. Rob. Autom. 14(5), 786–795 (1998)

    Article  Google Scholar 

  7. Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 50(12 Supplement), 1861–1871 (2004)

    Article  Google Scholar 

  8. Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Glover, F., Kochenagen, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publishers, Boston (2003)

    Google Scholar 

  9. Hoitomt, D.J., Luh, P.B., Pattipati, K.R.: A practical approach to job-shop scheduling problems. IEEE Trans. Rob. Autom. 9(1), 1–13 (1993)

    Article  Google Scholar 

  10. Karageorgos, A., Mehandjiev, N., Weichhart, G., Hämmerle, A.: Agent-based optimisation of logistics and production planning. Eng. Appl. Artif. Intell. 16(4), 335–348 (2003)

    Article  Google Scholar 

  11. Kaskavelis, C.A., Caramanis, M.C.: Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE Trans. 30(11), 1085–1097 (1998)

    Google Scholar 

  12. Leitão, P., Mařík, V., Vrba, P.: Past, present, and future of industrial agent applications. IEEE Trans. Industr. Inf. 9(4), 2360–2372 (2013)

    Article  Google Scholar 

  13. Mönch, L.: Problem instances for flexible job shops with due dates (2015). http://p.2schedgen.fernuni-hagen.de/index.php?id=174

  14. Monostori, L., Valckenaers, P., Dolgui, A., Panetto, H., Brdys, M., Csáji, B.C.: Cooperative control in production and logistics. Ann. Rev. Control 39, 12–29 (2015)

    Article  Google Scholar 

  15. Van Brussel, H., Wyns, J., Valckenaers, P., Bongaerts, L., Peeters, P.: Reference architecture for holonic manufacturing systems: PROSA. Comput. Ind. 37(3), 255–274 (1998). http://www.sciencedirect.com/science/article/pii/S016636159800102X

    Article  Google Scholar 

  16. Wang, J., Luh, P.B., Zhao, X., Wang, J.: An optimization-based algorithm for job shop scheduling. Sadhana 22(2), 241–256 (1997)

    Article  Google Scholar 

  17. Zimmermann, J., Mönch, L.: Design and implementation of adaptive agents for complex manufacturing systems. In: Mařík, V., Vyatkin, V., Colombo, A.W. (eds.) HoloMAS 2007. LNCS (LNAI), vol. 4659, pp. 269–280. Springer, Heidelberg (2007). http://dx.doi.org/10.1007/978-3-540-74481-8_26

    Chapter  Google Scholar 

Download references

Acknowledgement

The research leading to these results is funded by the Austrian Ministry for Transport, Innovation and Technology www.bmvit.gv.at through the project NgMPPS-DPC : Next-Generation Multi-Purpose Production Systems – Decentralised production control based on distributed optimisation.

Author information

Authors and Affiliations

  1. Profactor GmbH, Steyr, Austria

    Georg Weichhart & Alexander Hämmerle

  2. Department of Communications Engineering - Business Informatics, Johannes Kepler University, Linz, Austria

    Georg Weichhart

Authors
  1. Georg Weichhart
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Hämmerle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Georg Weichhart .

Editor information

Editors and Affiliations

  1. DFKI , Saarbrücken, Germany

    Matthias Klusch

  2. Institute for Computer Science &, University of Duisburg-Essen Institute for Computer Science &, Essen, Nordrhein-Westfalen, Germany

    Rainer Unland

  3. IBM Haifa Research Lab , Haifa, Israel

    Onn Shehory

  4. University of Hamburg VSIS, Hamburg, Hamburg, Germany

    Alexander Pokahr

  5. Distributed Artificial Intelligence, Technical University of Berlin Distributed Artificial Intelligence, Berlin, Berlin, Germany

    Sebastian Ahrndt

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Weichhart, G., Hämmerle, A. (2016). Multi-actor Architecture for Schedule Optimisation Based on Lagrangian Relaxation. In: Klusch, M., Unland, R., Shehory, O., Pokahr, A., Ahrndt, S. (eds) Multiagent System Technologies. MATES 2016. Lecture Notes in Computer Science(), vol 9872. Springer, Cham. https://doi.org/10.1007/978-3-319-45889-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45889-2_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45888-5

  • Online ISBN: 978-3-319-45889-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation