Skip to main content
SpringerLink
Log in

Ant Colony System for JSP

  • Conference paper
Cellular Automata (ACRI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3305))

Included in the following conference series:

Abstract

This paper discusses the application of ACS metaheuristics (based on behaviour of real ants: stigmergy and synergetic effect among ants) for Job-Shop Scheduling problem (JSP). This algorithm is improved by introducing the concept of critical events, in which two new techniques will be applied. Thus, a more flexible heuristic technique is obtained, which improves the performance of ant colony system for JSP.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34, 391–401 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Applegate, D., Cook, W.: A computational study of the Job Shop Scheduling Problem. ORSA J. Computing 3, 149–156 (1991)

    MATH  Google Scholar 

  3. Blackstone, J.N., Philips, D.T., Hogg, C.L.: A state of the Art survey of manufacturing job shop operations. International Journal of Production Research 20, 27–45 (1982)

    Article  Google Scholar 

  4. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence. From Natural to Artificial Systems. Oxford University Press, Oxford (1999)

    Google Scholar 

  5. Boryczka, U., Boryczka, M.: Generative Policies in Ant Systems. In: Proceedings of the Workshop: Intelligent Information Systems V, Dȩblin (1996)

    Google Scholar 

  6. Brucker, P., Jurisch, B., Sievers, B.: A Branch and Bound algorithm for the job shop problem. Discrete Appl. Math. 49, 107–127 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Carlier, J., Pinson, E.: An algorithm for solving the job-shop problem. Management Science 35(2), 164–176 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chambers, J.B., Wesley Barnes, J.: New tabu search results for the Job Shop Scheduling Problem. University of Texas (1996)

    Google Scholar 

  9. Cheng, C.-C., Smith, S.F.: Applying constraint satisfaction techniques to job shop scheduling. Carnegie Mellon University, Pittsburgh (1995)

    Google Scholar 

  10. Dorigo, M., Colorni, A., Maniezzo, V., Trubian, M.: Ant system for job shop scheduling. Belgian Journal of Operational Research, Statistics and Computer Science (1994)

    Google Scholar 

  11. Dorigo, M., Gambardella, L.M.: A study of some properties of Ant_Q. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 656–665. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  12. Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comp. 1, 53–66 (1997)

    Article  Google Scholar 

  13. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117–129 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gere, W.S.: Heuristics in job shop scheduling. Management Sci. 13, 167–190 (1996)

    Article  Google Scholar 

  15. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals on Discrete Mathematics 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  16. Haupt, R.: A survey of scheduling rules. Operations Research 25, 45–61 (1989)

    Google Scholar 

  17. Ishii, N., Talavage, J.T.: A mixed dispatching rule approach in FMS scheduling. International J. Flexible Manufacturing Systems, 69–87 (1994)

    Google Scholar 

  18. Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by Simulated Annealing. Operations Research 40, 113–125 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  19. Lawrence, S.: Resource constraint project scheduling: an experimental investigation of heuristic scheduling techniques. Technical Report, Graduate School of Industrial Administration (1984)

    Google Scholar 

  20. Muth, J.F., Thompson, G.L.: Industrial Scheduling. Prentice-Hall, Englewood Cliffs (1963)

    Google Scholar 

  21. Nowicki, E., Smutnicki, C.: A fast Taboo Search algorithm for the job shop problem. TU Wroclav, Preprint, 8/93 (1993)

    Google Scholar 

  22. Panwalkar, S.S., Iskander, W.: A survey of scheduling rules. Operations Research 25, 25–61 (1977)

    Article  MathSciNet  Google Scholar 

  23. Pesch, E.: Machine Learning by Schedule Decomposition. University of Limburg (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, ul. Bedzinska 39, 41-200, Sosnowiec, Poland

    Urszula Boryczka

Authors
  1. Urszula Boryczka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boryczka, U. (2004). Ant Colony System for JSP. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_31

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation