Skip to main content

An Investigation of Agent-Based Hybrid Approach to Solve Flowshop and Job-Shop Scheduling Problems

  • Conference paper

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

Abstract

The paper investigates a possibility of combining the population learning algorithm and the A-Team concept with a view to increase quality of results and efficiency of computations. To implement the idea a middleware environment called JABAT is used. The proposed approach is validated experimentally using benchmark datasets containing instances of the two well-known combinatorial optimization problems: flow shop and job shop scheduling.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aydin, M.E., Fogarty, T.C.: Teams of Autonomous Agents for Job-Shop Scheduling Problems: An Experimental Study. Journal of Intelligent Manufacturing 15(4), 455–462 (2004)

    Article  Google Scholar 

  2. Aydin, M.E., Fogarty, T.C.: A Simulated Annealing Algorithm for Multi-agent Systems: a Job-Shop Scheduling Application. Journal of Intelligent Manufacturing 15(6), 805–814 (2004)

    Article  Google Scholar 

  3. Bellifemine, F., Caire, G., Poggi, A., Rimossa, G.: JADE. A White Paper, Exp. 3(3), 6–20 (2003)

    Google Scholar 

  4. de Boer, P.T., Kroese, D.P, Mannor, S., Rubinstien, R.Y: A Tutorial on the Cross-Entropy Method. Annals of Operations Research 134(1), 19–67 (2005)

    Article  MATH  Google Scholar 

  5. Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences 8(1), 156–166 (1977)

    Article  Google Scholar 

  6. Jȩdrzejowicz, P.: Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems. Foundation of Computing and Decision Sciences 24, 51–66 (1999)

    Google Scholar 

  7. Jȩdrzejowicz, J., Jȩdrzejowicz, P.: PLA-Based Permutation Scheduling. Foundations of Computing and Decision Sciences 28(3), 159–177 (2003)

    Google Scholar 

  8. Jȩdrzejowicz, J., Jȩdrzejowicz, P.: New Upper Bounds for the Permutation Flowshop Scheduling problem. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS (LNAI), vol. 3533, pp. 232–235. Springer, Heidelberg (2005)

    Google Scholar 

  9. Jȩdrzejowicz, J., Jȩdrzejowicz, P.: Agent-Based Approach to Solving Difficult Scheduling Problems. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS (LNAI), vol. 4031, pp. 24–33. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Jȩdrzejowicz, P., Wierzbowska, I.: JADE-Based A-Team Environment. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3993, pp. 719–726. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Kirkpatrick, S.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)

    Article  Google Scholar 

  12. Kolonko, M.: Some New Results on Simulated Annealing Applied to Job Shop Scheduling Problem. European Journal of Operational Research 113, 123–136 (1999)

    Article  MATH  Google Scholar 

  13. Marinescu, D.C., Boloni, L.: A Component-Based Architecture for Problem Solving Environments. Mathematics and Computers in Simulation 54, 279–293 (2000)

    Article  MATH  Google Scholar 

  14. Parunak, H.V.D.: Experiences and Issues in the Development and Deployment of Industrial Agent-Based Systems. Intern. J. of Cooperative Information Systems 9(3), 209–228 (2000)

    Article  Google Scholar 

  15. Ruiz, R., Maroto, C., Alcaraz, J.: New Genetic Algorithms for the Permutation Flowshop Scheduling Problems. In: Proc. The Fifth Metaheuristic International Conference, Kyoto, 63–1–63–8 (2003)

    Google Scholar 

  16. Satake, T., Morikawa, K., Takahashi, K., Nakamura, N.: Simulated Annealing Approach for Minimising the Makespan of the General Job-Shop. International Journal of Production Economics 60-61, 515–522 (1999)

    Article  Google Scholar 

  17. Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Co-operation Schemes for Autonomous, Computer-Based Agents, Technical Report EDRC 18–59–96, Carnegie Mellon University, Pittsburgh (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bruno Apolloni Robert J. Howlett Lakhmi Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jędrzejowicz, J., Jędrzejowicz, P. (2007). An Investigation of Agent-Based Hybrid Approach to Solve Flowshop and Job-Shop Scheduling Problems. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74819-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74819-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74817-5

  • Online ISBN: 978-3-540-74819-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics