Abstract
This paper describes some developing issues for ACS based software tools to support decision making process and solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System (ACS) based algorithm performance is validated with benchmark problems available in the OR library. The obtained results were compared with the optimal (best available results in some cases) and permit to conclude about ACS efficiency and effectiveness. The ACS performance and respective statistical significance was evaluated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, K.R.: Introduction to Scheduling, Brussels, vol. 32 (1992)
Baker, K.R., Trietsch, D.: Optimization methods for the single machine probelm. In: Principles of Sequencing and Scheduling, 1st edn., pp. 34–56. Wiley, New York (2009)
Dorigo, M.: Swarm Intelligence, vol. (4). Springer, New York (2007)
Dorigo, M., Birattari, M., Stützle, T.: Ant Colony Optimization - Artificial Ants as a Computational Intelligence Technique. IEEE Computational Intelligence Magazine (2006)
Lawer, E.L.: A pseudopolinomial algorithm for sequencing Jobs to Minimize Total Tardiness. Annals of Discrete Mathematics, 331–342 (1997)
Reynolds, R.G.: An Introduction to Cultural Algorithms. In: Proceedings of the 3rd Annual Conference on Evolutionary Programming, pp. 131–139. World Scienfific Publishing (1994)
Merkle, D., Middendorf, M.: On solving permutation scheduling problems with ant colony optimization. International Journal of Systems Science 36(5), 255–266 (2005)
Liao, C., Juan, H.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers & Operations Research 34, 1899–1909 (2007)
Yagmahan, B., Yenisey, M.M.: Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering 54, 411–420 (2008)
Anghinolfi, D., Paolucci, M.: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. International Journal of Operations Research 5(1), 1–17 (2008)
Srinivasa Raghavan, N.R., Venkataramana, M.: Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization. The International Journal of Advanced Manufacturing Technology 41(9-10), 986–996 (2009)
den Besten, M., Stützle, T., Dorigo, M.: Ant colony optimization for the total weighted tardiness problem. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J., Schwefel, H.-P. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 611–620. Springer, Heidelberg (2000)
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)
Dorigo, M.: Optimization, Learning and Natural Algorithms, PhDThesis, Politecnico di Milano, Italy, in Italian (1992)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press (2004)
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Dipartimentodi Elettronica, Politecnico di Milano, Italy, Tech. Rep. 91-016 (1991)
Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems 43(2), 73–81 (1997)
Gambardella, L.M., Dorigo, M.: Solving symmetric and asymmetric TSPs by ant colonies. In: Baeck, T., et al. (eds.) Proc. 1996 IEEE International Conference on Evolutionary Computation (ICEC 1996), pp. 622–627. IEEE Press, Piscataway (1996)
Stützle, T., et al.: Parameter Adaptation in Ant Colony Optimization, IRIDIA, Bruxelles, Belgium, Tech. Rep. TR/IRIDIA/2010-002 (January 2010)
El-Ghazali Talbi, Metaheuristics – From Design to Implementation. Wiley (2009)
Madureira, A., Pereira, I., Falcão, D.: Ant Colony System Based Approach to Single Machine Scheduling Problems — Weighted Tardiness Scheduling Problem. In: International Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC 2012), México, de November 5-9 (2012)
Pirlot, M.: General Local Search Method. European Journal of Operational Research 92, 493–522 (1996)
OR-Library - http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Madureira, A., Pereira, I., Abraham, A. (2013). Developing Issues for Ant Colony System Based Approach for Scheduling Problems. In: Gavrilova, M.L., Tan, C.J.K., Abraham, A. (eds) Transactions on Computational Science XXI. Lecture Notes in Computer Science, vol 8160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45318-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-45318-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45317-5
Online ISBN: 978-3-642-45318-2
eBook Packages: Computer ScienceComputer Science (R0)