Skip to main content

Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System

  • Conference paper
  • First Online:
  • 1958 Accesses

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

The weighted earliness tardiness parallel machine scheduling problem is NP hard. It is herein approximately solved using a decentralized multi-agent system (MAS). MAS acts as a moderator of two types of agents: free jobs, and groups of jobs assigned to machines. MAS yields good solutions’ quality in reduced run times as evidenced by the computational results. Most importantly, it can be easily adapted to similar problems.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Lee, C.Y., Kim, S.J.: Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights. Comput. Ind. Eng. 28, 231–243 (1995)

    Article  Google Scholar 

  2. Lawler, E.L.: A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1, 331–342 (1977)

    Article  Google Scholar 

  3. Jennings, N.R., Wooldridge, M.J.: Applying Agent Technology. International Journal of Applied Artificial Intelligence 9(4), 351–369 (1995)

    Article  Google Scholar 

  4. Parunak, H.V.D.: Agents in Overalls: Experiences and Issues in the Development and Deployment of Industrial Agent-Based Systems. International Journal of Cooperative Information Systems 9(3), 209–228 (2000)

    Article  Google Scholar 

  5. M’Hallah, R., Al-Khamis, T.: Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic. International Journal of Production Research 50(10), 2639–2664 (2012)

    Article  Google Scholar 

  6. Wooldridge, M.J., Jennings N.R.: Agent Theories, Architectures and Languages: A Survey. In: ECAI94 Workshop on Agent Theories Architectures and Languages, pp. 1–32. Amsterdam, Netherlands (1994).

    Google Scholar 

  7. Yager, R., Filev, D.: Essentials of Fuzzy Modeling and Control. John Wiley, New York (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Polyakovskiy .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Polyakovskiy, S., M’ Hallah, R. (2014). Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_62

Download citation

Publish with us

Policies and ethics