Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2015, Article ID 838925, 13 pages
http://dx.doi.org/10.1155/2015/838925
Research Article

Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach

1Industrial Engineering Department, Engineering Faculty, Sakarya University, Esentepe Campus, 54187 Sakarya, Turkey
2Electrical and Electronics Engineering Department, Faculty of Technology, Sakarya University, Esentepe Campus, 54187 Sakarya, Turkey

Received 25 November 2014; Accepted 9 April 2015

Academic Editor: Karim G. Oweiss

Copyright © 2015 Tarik Cakar and Rasit Koker. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. C. Eberhart and J. A. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS '95), pp. 39–43, Nagoya, Japan, October 1995. View at Publisher · View at Google Scholar
  2. A. H. G. R. Kan, B. J. Lageweg, and J. K. Lenstra, “Minimizing total costs in one-machine scheduling,” Operations Research, vol. 23, no. 5, pp. 908–927, 1975. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. C. N. Potts and L. N. van Wassenhove, “A Branch and bound algorithm for total weighted tardiness problem,” Operations Research, vol. 33, no. 2, pp. 363–377, 1985. View at Publisher · View at Google Scholar · View at Scopus
  4. T. S. Abdul-Razaq, C. N. Potts, and L. N. van Wassenhove, “A survey of algorithms for the single machine total weighted tardiness scheduling problem,” Discrete Applied Mathematics, vol. 26, no. 2-3, pp. 235–253, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  5. M. Held and R. M. Karp, “A dynamic programming approach to sequencing problem,” Journal of Society for Industrial and Applied Mathematics, vol. 10, no. 1, pp. 196–210, 1962. View at Google Scholar
  6. K. R. Baker and L. E. Schrage, “Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks,” Operations Research, vol. 26, no. 1, pp. 111–120, 1978. View at Publisher · View at Google Scholar · View at Scopus
  7. L. E. Schrage and K. R. Baker, “Dynamic programming solution of sequencing problems with precedence constraints,” Operations Research, vol. 26, no. 3, pp. 444–449, 1978. View at Publisher · View at Google Scholar · View at Scopus
  8. T. D. Fry, L. Vicens, K. Macleod, and S. Fernandez, “A heuristic solution procedure to minimize T- on a single machine,” Journal of the Operational Research Society, vol. 40, no. 3, pp. 293–297, 1989. View at Publisher · View at Google Scholar
  9. M. S. Akturk and D. Ozdemir, “A new dominance rule to minimize total weighted tardiness with unequal release dates,” European Journal of Operational Research, vol. 135, no. 2, pp. 394–412, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. T. Cakar, “Single machine scheduling with unequal release date using neuro-dominance rule,” Journal of Intelligent Manufacturing, vol. 22, no. 4, pp. 481–490, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Mahnam and G. Moslehi, “A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times,” Engineering Optimization, vol. 41, no. 6, pp. 521–536, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. T. Eren, “Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect,” Applied Mathematics and Computation, vol. 208, no. 2, pp. 355–358, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. J. M. Van den Akker, G. Diepen, J. A. Hoogeveen et al., “Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs,” Journal of Scheduling, vol. 13, no. 6, pp. 561–576, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Kooli and M. Serairi, “A mixed integer programming approach for the single machine problem with unequal release dates,” Computers and Operations Research, vol. 51, pp. 323–330, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  15. Y. Yin, W.-H. Wu, S.-R. Cheng, and C.-C. Wu, “An investigation of a two-agent single-machine scheduling problem with unequal release dates,” Computers and Operations Research, vol. 39, no. 12, pp. 3062–3073, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. C. Wu, P. H. Hsu, and K. Lai, “Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times,” Journal of Manufacturing Systems, vol. 30, no. 1, pp. 54–62, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Matsuo, C. J. Suh, and R. S. Sullivan, “A controlled search simulated annealing method for the single machine weighted tardiness problem,” Annals of Operations Research, vol. 21, no. 1–4, pp. 85–108, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. H. A. Crauwels, C. N. Potts, and L. N. Van Wassenhove, “Local search heuristics for the single machine total weighted tardiness scheduling problem,” INFORMS Journal on Computing, vol. 10, no. 3, pp. 341–350, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. M. Den Besten, T. Stützle, and M. Dorigo, “Ant colony optimization for the total weighted tardiness problem,” in Parallel Problem Solving from Nature PPSN: Proceedings of the 6th International Conference Paris, France, September 18–20, 2000, vol. 1917 of Lecture Notes in Computer Science, pp. 611–620, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  20. D. Merckle and M. Middendorf, “An ant algorithm with a new pheromone evaluation rule for total tardiness problems,” in Real-World Applications of Evolutionary Computing: Proceedings of the EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight Edinburgh, Scotland, UK, April 17, 2000, vol. 1803 of Lecture Notes in Computer Science, pp. 290–299, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  21. M. Laguna, J. W. Barnes, and F. W. Glover, “Tabu search methods for a single machine scheduling problem,” Journal of Intelligent Manufacturing, vol. 2, no. 2, pp. 63–73, 1991. View at Publisher · View at Google Scholar · View at Scopus
  22. T. C. Cheng, A. A. Lazarev, and E. R. Gafarov, “A hybrid algorithm for the single-machine total tardiness problem,” Computers & Operations Research, vol. 36, no. 2, pp. 308–315, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. M. F. Tasgetiren, M. Sevkli, Y.-C. Liang, and G. Gencyilmaz, “Particle swarm optimization algorithm for single machine total weighted tardiness problem,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 2, pp. 1412–1419, IEEE, Portland, Ore, USA, June 2004. View at Publisher · View at Google Scholar
  24. R. Panneerselvam, “Simple heuristic to minimize total tardiness in a single machine scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 30, no. 7-8, pp. 722–726, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. T. Sen, J. M. Sulek, and P. Dileepan, “Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey,” International Journal of Production Economics, vol. 83, no. 1, pp. 1–12, 2003. View at Publisher · View at Google Scholar · View at Scopus
  26. C. Koulamas, “The single-machine total tardiness scheduling problem: review and extensions,” European Journal of Operational Research, vol. 202, no. 1, pp. 1–7, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. Q. Y. Yang, J. G. Sun, J. Y. Zhang, and C. J. Wang, “A discrete particle swarm algorithm for single machine total tardiness problems,” in Proceeding of International Conference on Artificial Intelligence, pp. 529–532, 2006.
  28. Y. Ortakci, Comparing particle swarm optimization methods with aplications [M.S. thesis], Karabuk University Science and Technology Institute, Karabük, Turkey, 2011.
  29. T. Cakar, “A new neuro-dominance rule for single machine tardiness problem,” in Computational Science and Its Applications—ICCSA 2005, vol. 3483 of Lecture Notes in Computer Science, pp. 1241–1250, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  30. M. Fera, F. Fruggiero, A. Lambiase, G. Martino, and M. E. Nenni, “Production scheduling approaches for operations management,” in Operations Management, M. Schiraldi, Ed., InTech, 2013. View at Publisher · View at Google Scholar
  31. R. Köker, “A neuro-simulated annealing approach to the inverse kinematics solution of redundant robotic manipulators,” Engineering with Computers, vol. 29, no. 4, pp. 507–515, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. T. Çakar, H. R. Yazgan, and R. Köker, “Parallel robot manipulators, new developments,” in Parallel Robot Scheduling with Genetic Algorithms, J.-H. Ryu, Ed., pp. 153–170, I-Tech Education and Publishing, Vienna, Austria, 2008. View at Google Scholar
  33. T. Çakar, R. Köker, and H. I. Demir, “Parallel robot scheduling to minimize mean tardiness with precedence constraints using a genetic algorithm,” Advances in Engineering Software, vol. 39, no. 1, pp. 47–54, 2008. View at Publisher · View at Google Scholar · View at Scopus
  34. C. N. Potts and L. N. Van Wassenhove, “Dynamic programming and decomposition approaches for the single machine total tardiness problem,” European Journal of Operational Research, vol. 32, no. 3, pp. 405–414, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. M. S. Akturk and M. B. Yildirim, “A new lower bounding scheme for the total weighted tardiness problem,” Computers and Operations Research, vol. 25, no. 4, pp. 265–278, 1998. View at Publisher · View at Google Scholar · View at Scopus