Skip to main content

Multi-constraint System Scheduling Using Dynamic and Delay Ant Colony System

  • Conference paper
New Trends in Applied Artificial Intelligence (IEA/AIE 2007)

Abstract

This study presents and evaluates a modified ant colony optimization (ACO) approach for the precedence and resource-constrained multiprocessor scheduling problems. A modified ant colony system, with two designed rules, called dynamic and delay ant colony system, is proposed to solve the scheduling problems. The dynamic rule is designed to modify the latest starting time of jobs and hence the heuristic function. A delay solution generation rule in exploration of the search solution space is used to escape the local optimal solution. Simulation results demonstrate that the proposed modified ant colony system algorithm provides an effective and efficient approach for solving multiprocessor system scheduling problems with precedence and resource constraints.

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

Access this chapter

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.

Similar content being viewed by others

References

  1. Hou, E.S.H., Ansari, N., Ren, H.: A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems 5(2), 113–120 (1994)

    Article  Google Scholar 

  2. Correa, R.C., Ferreira, A., Rebreyend, P.: Integrating list heuristics into genetic algorithms for multiprocessor scheduling. Parallel and Distributed Processing. In: Eighth IEEE Symposium. pp. 462–469 (1996)

    Google Scholar 

  3. Correa, R.C., Ferreira, A., Rebreyend, P.: Scheduling multiprocessor tasks with genetic algorithms. IEEE Transactions on Parallel and Distributed Systems 10(8), 825–837 (1999)

    Article  Google Scholar 

  4. Oh, J., Wu, C.: Genetic-algorithm-based real-time task scheduling with multiple goals. J. of Systems and Software 71(3), 245–258 (2004)

    Article  Google Scholar 

  5. Kwok, Y.K., Ahmad, I., Gu, J.: FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors. Parallel Processing. In: Proceedings of the 1996 International Conference on, vol. 2, pp. 150–157 (1996)

    Google Scholar 

  6. Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems Publication 13(3), 260–274 (2002)

    Article  Google Scholar 

  7. Maniezzo, V., Carbonaro, A.: Ant Colony Optimization: an Overview. In: Proceedings of MIC’99, III Metaheuristics International Conference, Brazil (1999)

    Google Scholar 

  8. Stützle, T., Hoos, H.H.: MAX-MIN Ant system. Future Generation Computer Systems 16(9), 889–914 (2000)

    Article  Google Scholar 

  9. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  10. Pierucci, P., Brandani, E.R., Sogaro, A.: An industrial application of an on-line data reconciliation and optimization problem. Computers & Chemical Engineering 20, S1539–S1544 (1996)

    Article  Google Scholar 

  11. Besten, M.D., Sttzle, T., Dorigo, M.: Ant Colony Optimization for the Total Weighted Tardiness Problem. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) Parallel Problem Solving from Nature-PPSN VI. LNCS, vol. 1917, pp. 611–620. Springer, Berlin (2000)

    Google Scholar 

  12. Gajpal, Y., Rajendran, C., Ziegler, H.: An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs. European Journal of Operational Research 155(2), 426–438 (2004)

    Article  Google Scholar 

  13. Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155(2), 426–438 (2004)

    Article  MATH  Google Scholar 

  14. Brucker, P., Drexel, A., Möhring, R.H., Neumann, K., Pesch, E.: Resource-constraint project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3–41 (1999)

    MATH  Google Scholar 

  15. Herroelen, W.B., Reyck, D., Demeulemeester, E.: Resource-constrained project scheduling: A survey of recent developments. Comput. Oper. Res. 13(4), 279–302 (1998)

    Article  Google Scholar 

  16. Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. on Evolutionary Computation 6(4), 333–346 (2002)

    Article  Google Scholar 

  17. Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C.: An ant colony optimization approach for the single machine total tardiness problem. In: Proc. 1999 Congr. Evolutionary Computation, pp. 1445–1450 (1999)

    Google Scholar 

  18. Iredi, S., Merkle, D., Middendorf, M.: Bi-Criterion Optimization with Multi Colony Ant Algorithms. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 359–372. Springer, Heidelberg (2001)

    Google Scholar 

  19. Merkle, D., Middendorf, M.: A new approach to solve permutation scheduling problems with ant colony optimization. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 484–494. Springer, Heidelberg (2001)

    Google Scholar 

  20. Huang, Y.M., Chen, R.M.: Scheduling multiprocessor job with resource and timing constraints using neural network. IEEE Trans. on System, Man and Cybernetics, part B 29(4), 490–502 (1999)

    Article  Google Scholar 

  21. Chen, R.M., Lo, S.T., Huang, Y.M.: Combining competitive scheme with slack neurons to solve real-time job scheduling problem. Expert Systems with Applications (In Press)

    Google Scholar 

  22. Chen, R.M., Huang, Y.M: Multiconstraint task scheduling in multiprocessor system by neural network. In: Proc. IEEE Tenth Int. Conf. on Tools with Artificial Intelligence, Taipei, pp. 288–294 (1998)

    Google Scholar 

  23. Chen, R.M., Huang, Y.M.: Competitive Neural Network to Solve Scheduling Problem. Neurocomputing 37(1-4), 177–196 (2001)

    Article  MATH  Google Scholar 

  24. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. on Sys. Man & Cyber. 26(1), 1–13 (1996)

    Google Scholar 

  25. Kolisch, R., Schwindt, C., Sprecher, A.: Benchmark instances for project scheduling problems. In: Weglarz, J. (ed.) Handbook on Recent Advances in Project Scheduling, pp. 147–178. Kluwer, Amsterdam (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hiroshi G. Okuno Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Lo, ST., Chen, RM., Huang, YM. (2007). Multi-constraint System Scheduling Using Dynamic and Delay Ant Colony System. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73325-6_65

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-73325-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics