A HYBRID METAHEURISTIC FOR SOLVING SINGLE MACHINE SCHEDULING PROBLEM

Adrian Serbencu, Viorel Mînzu, Daniela Cernega, Adriana Serbencu

Abstract

This paper proposes a metaheuristic for solving the Single Machine Scheduling Problem that is implemented by a hybrid system made up of an Ant Colony System and a stochastic descent algorithm called Kangaroo. The hybrid system is based on the collaboration between a social type multiagent system and an Iterated Solution Improvement method.

References

  1. Bauer A., Bullnheimer B., Hartl R.F. And Strauss C., 1999. An ant colony optimization approach for the single machine total tardiness problem, In Proc. of CEC'99, pages 1445-1450, IEEE Press, Piscataway, NJ,.
  2. Beckers R., Deneubourg J.L., And Goss S., 1992. Trails and U-turns in the selection of the shortest path by the ant Lasius Niger, Journal of Theoretical Biology, vol. 159, pp. 397-415.
  3. Dorigo, M., Maniezzo V. And Colorni A., 1996. The Ant System: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26, 29-41,
  4. Dorigo M. And Gambardella L.M., 1997a. Ant colonies for the traveling salesman problem, BioSystems, 43, 73-81.
  5. Dorigo M. And Gambardella L.M., 1997b. Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1(1):53-66.
  6. Fleury G., 1995. Application des méthodes stochastiques inspirées du recuit simulé à des problèmes d'ordonnancement, Automatique Productique Informatique Industrielle vol. 29-no 4-5, pp. 445-470.
  7. Garey M; Johnson D. ,1995. Computers and Intractability: a guide to the theory on NP-completeness- New York W. H. Freeman and Co. Publishers.
  8. Gloverf, 1989. Tabu Search- part i. ORSA Journal of Computing vol. 1 1989 pp. 190-206.
  9. Kirkpatrick S. et all, 1983 -Optimization by simulated annealing- Science vol.220 no.4598 May 1983 pp 671- 680
  10. Madureira A. Et All, 2000. A GA Based Scheduling System for Dynamic Single Machine Scheduling Problem, ISATP 2000, Fukuoka.
  11. Mahfoud S.; Goldberg D, 1995. Parallel recombination simulated annealing: A genetic algorithm. Parallel computing vol. 21 1995 pp. 1-28.
  12. Matthijs Den Besten, Stützle T. And Dorigo M., 2000 Ant Colony Optimization for the Total Weighted Tardiness Problem, In Deb et al, editors, Proceedings of PPSNVI, Sixth International Conference on Parallel Problem Solving from Nature, volume 1917 of LNCS, pages 611-620.
  13. Minzu V. And Henrioud J.M, 1998. Stochastic algorithm for the tasks assignment in single or mixe model assembly lines, European Journal of Automation, Vol. 32 No 7-8, pp 831-851.
  14. Papadimitriou C.; Steiglitz K., 1982. Combinatorial Optimization: Algorithms and Complexity - PrinticeHall.
  15. Taillard et al., 1998. La programmation à mémoire adaptative ou l'évolution des algorithmes évolutifs. Calculateurs parallèles vol. 10 no. 2 April 1998 pp. 117-140.
  16. Vaessens R. et al, 1992. A local search template. Parallel Problem Solving From Nature R. Manner and B. Manderick Edition Université Libre de Bruxelles pp. 67-76 Belgium.
Download


Paper Citation


in Harvard Style

Serbencu A., Mînzu V., Cernega D. and Serbencu A. (2009). A HYBRID METAHEURISTIC FOR SOLVING SINGLE MACHINE SCHEDULING PROBLEM . In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO, ISBN 978-989-8111-99-9, pages 68-74. DOI: 10.5220/0002210700680074


in Bibtex Style

@conference{icinco09,
author={Adrian Serbencu and Viorel Mînzu and Daniela Cernega and Adriana Serbencu},
title={A HYBRID METAHEURISTIC FOR SOLVING SINGLE MACHINE SCHEDULING PROBLEM},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},
year={2009},
pages={68-74},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002210700680074},
isbn={978-989-8111-99-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,
TI - A HYBRID METAHEURISTIC FOR SOLVING SINGLE MACHINE SCHEDULING PROBLEM
SN - 978-989-8111-99-9
AU - Serbencu A.
AU - Mînzu V.
AU - Cernega D.
AU - Serbencu A.
PY - 2009
SP - 68
EP - 74
DO - 10.5220/0002210700680074