Skip to main content
SpringerLink
Log in

Combinatorial Auctions for Coordination and Control of Manufacturing MAS: Updating Prices Methods

  • Conference paper
Soft Computing Models in Industrial and Environmental Applications, 5th International Workshop (SOCO 2010)

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 73))

Abstract

We use the paradigm of multiagent systems to solve the Job Shop problem. It concerns the allocation of machines to operations of some production process over time periods and its goal is the optimization of one or several objectives. We propose a combinatorial auction mechanism to coordinate agents. The “items” to be sold are the time slots that we divide the time horizon into. In tasks scheduling problems tasks need a combination of time slots of multiple resources to do the operations. The use of auctions in which different valuations of interdependent items are considered (e.g. combinatorial auctions) is necessary. The auctioneer fixes prices comparing the demand over a time slot of a resource with the capacity of the resource in this time slot. Our objective is to find an updating price method for combinatorial auctions that meet the needings of scheduling manufacturing systems in dynamic environments, e.g. robustness, stability, adaptability, and efficient use of available resources.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pinedo, E.P.M.L.: Scheduling, 2nd edn. Springer, New York (2008)

    MATH  Google Scholar 

  2. Shen, W.: Distributed manufacturing scheduling using intelligent agents. Intelligent Systems 17(1), 88–94 (2002)

    Article  Google Scholar 

  3. Shen, W., et al.: Applications of agent-based systems in intelligent manufacturing: An updated review. Advanced Engineering Informatics 20(4), 415–431 (2006)

    Article  Google Scholar 

  4. Lee, Kim: Multi-agent systems applications in manufacturing systems and supply chain management: a review paper. International Journal of Production Research 46(1), 233–265 (2008)

    Article  MATH  Google Scholar 

  5. Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling 12(4), 417–431 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kutanoglu, E., Wu, S.D.: On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Transactions 31(9), 813–826 (1999)

    Google Scholar 

  7. Wellman, M.P., et al.: Auction Protocols for Decentralized Scheduling. Games and Economic Behavior 35(1-2), 271–303 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Vries, S., Vohra, R.V.: Combinatorial Auctions: A Survey. Informs Journal on Computing 15(3), 284–309 (2003)

    Article  MathSciNet  Google Scholar 

  9. Dewan, P., Joshi, S.: Auction-based distributed scheduling in a dynamic job shop environment. International Journal of Production Research 40(5), 1173–1191 (2002)

    Article  MATH  Google Scholar 

  10. Duffie, N.A.: Synthesis of heterarchical manufacturing systems. Comput. Ind. 14(1-3), 167–174 (1990)

    Article  Google Scholar 

  11. Wang, J., et al.: An optimization-based algorithm for job shop scheduling. SADHANA 22, 241–256 (1997)

    Article  Google Scholar 

  12. Geoffrion, A.M.: Lagrangean relaxation for integer programming. En Approaches to Integer Programming, 82–114 (1974), http://dx.doi.org/10.1007/BFb0120690 (Accedido Mayo 20, 2009)

  13. Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 50(suppl.12), 1861–1871 (2004)

    Article  Google Scholar 

  14. Guignard, M.: Lagrangean relaxation. TOP 11(2), 151–200 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Camerini, P.M., Fratta, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. En Nondifferentiable Optimization, 26–34 (1975), http://dx.doi.org/10.1007/BFb0120697 (Accedido Junio 3, 2009)

  16. Brännlund, U.: A generalized subgradient method with relaxation step. Mathematical Programming 71(2), 207–219 (1995)

    Article  MathSciNet  Google Scholar 

  17. Zhao, X., Luh, P., Wang, J.: The surrogate gradient algorithm for Lagrangian relaxation method. In: Proceedings of the 36th IEEE Conference on Decision and Control, vol. 1, pp. 305–310 (1997)

    Google Scholar 

  18. Chen, H., Luh, P.: An alternative framework to Lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research 149(3), 499–512 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Demirkol, E., Mehta, S., Uzsoy, R.: Benchmarks for shop scheduling problems. European Journal of Operational Research 109(1), 137–141 (1998)

    Article  MATH  Google Scholar 

  20. Kreipl, S.: A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling 3(3), 125–138 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INSISOC. Escuela Politécnica Superior, Universidad de Burgos, Spain

    Juan José Lavios Villahoz & Ricardo del Olmo Martínez

  2. INSISOC. ETSII, Universidad de Valladolid, Spain

    Alberto Arauzo Arauzo

Authors
  1. Juan José Lavios Villahoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ricardo del Olmo Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Arauzo Arauzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática y Automática, Facultad de Ciencias, Universidad de Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Emilio Corchado

  2. Departamento de Informática, Universidade do Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Paulo Novais  & Cesar Analide  & 

  3. Departamento de Ingeniería Electromecánica, Universidad de Burgos, Avenida Cantaria S/N, 09006, Burgos

    Javier Sedano

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Villahoz, J.J.L., del Olmo Martínez, R., Arauzo, A.A. (2010). Combinatorial Auctions for Coordination and Control of Manufacturing MAS: Updating Prices Methods. In: Corchado, E., Novais, P., Analide, C., Sedano, J. (eds) Soft Computing Models in Industrial and Environmental Applications, 5th International Workshop (SOCO 2010). Advances in Intelligent and Soft Computing, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13161-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13161-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13160-8

  • Online ISBN: 978-3-642-13161-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation