Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 786923, 24 pages
http://dx.doi.org/10.1155/2012/786923
Research Article

A Hybrid Multiobjective Genetic Algorithm for Robust Resource-Constrained Project Scheduling with Stochastic Durations

1Department of Management Science and Engineering, College of Information System and Management, National University of Defense Technology, Hunan, Changsha 410073, China
2School of Engineering and Information Technology, University of New South Wales at the Australian Defence Force Academy, Canberra ACT 2600, Australia
3Department of Computer Science, The University of York, York YO10 5GH, UK

Received 22 September 2011; Revised 23 November 2011; Accepted 7 December 2011

Academic Editor: Sri Sridharan

Copyright © 2012 Jian Xiong et al. 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. H. Moehring, “Minimizing costs of resource requirement in project networks subject to a fixed completion,” Operations Research, vol. 32, no. 1, pp. 89–120, 1984. View at Google Scholar · View at Scopus
  2. D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 333–346, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. W. Herroelen, B. De Reyck, and E. Demeulemeester, “Resource-constrained project scheduling: a survey of recent developments,” Computers and Operations Research, vol. 25, no. 4, pp. 279–302, 1998. View at Google Scholar · View at Scopus
  4. P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, “Resource-constrained project scheduling: notation, classification, models, and methods,” European Journal of Operational Research, vol. 112, no. 1, pp. 3–41, 1999. View at Google Scholar · View at Scopus
  5. R. Kolisch and R. Padman, “An integrated survey of deterministic project scheduling,” Omega, vol. 29, no. 3, pp. 249–272, 2001. View at Publisher · View at Google Scholar · View at Scopus
  6. R. Kolisch and S. Hartmann, “Experimental investigation of heuristics for resource-constrained project scheduling: an update,” European Journal of Operational Research, vol. 174, no. 1, pp. 23–37, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. S. Hartmann and D. Briskorn, “A survey of variants and extensions of the resource-constrained project scheduling problem,” European Journal of Operational Research, vol. 207, no. 1, pp. 1–14, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Van De Vonder, E. Demeulemeester, W. Herroelen, and R. Leus, “The use of buffers in project management: the trade-off between stability and makespan,” International Journal of Production Economics, vol. 97, no. 2, pp. 227–240, 2005. View at Publisher · View at Google Scholar · View at Scopus
  9. W. Herroelen and R. Leus, “Project scheduling under uncertainty: survey and research potentials,” European Journal of Operational Research, vol. 165, no. 2, pp. 289–306, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. M. A. Al-Fawzan and M. Haouari, “A bi-objective model for robust resource-constrained project scheduling,” International Journal of Production Economics, vol. 96, no. 2, pp. 175–187, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. B. Abbasi, S. Shadrokh, and J. Arkat, “Bi-objective resource-constrained project scheduling with robustness and makespan criteria,” Applied Mathematics and Computation, vol. 180, no. 1, pp. 146–152, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. H. Chtourou and M. Haouari, “A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling,” Computers and Industrial Engineering, vol. 55, no. 1, pp. 183–194, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. O. Lambrechts, E. Demeulemeester, and W. Herroelen, “A tabu search procedure for developing robust predictive project schedules,” International Journal of Production Economics, vol. 111, no. 2, pp. 493–508, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Ballestín and R. Leus, “Resource-constrained project scheduling for timely project completion with stochastic activity durations,” Production and Operations Management, vol. 18, no. 4, pp. 459–474, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. B. Ashtiani, R. Leus, and M. B. Aryanezhad, “New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits ofpre-processing,” Journal of Scheduling, pp. 1–15, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. V. Jorge Leon, S. David Wu, and R. H. Storer, “Robustness measures and robust scheduling for job shops,” IIE Transactions, vol. 26, no. 5, pp. 32–43, 1994. View at Google Scholar · View at Scopus
  17. Y. Jin and J. Branke, “Evolutionary optimization in uncertain environments—a survey,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 3, pp. 303–317, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. D. S. Lee, L. F. Gonzalez, J. Périaux, and K. Srinivas, “Efficient hybrid-game strategies coupled to evolutionary algorithms for robust multidisciplinary design optimization in aerospace engineering,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 2, pp. 133–150, 2011. View at Publisher · View at Google Scholar
  19. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
  20. S. Hartmann, “A competitive genetic algorithm for resource-constrained project scheduling,” Naval Research Logistics, vol. 45, no. 7, pp. 733–750, 1998. View at Google Scholar · View at Scopus
  21. S. Shadrokh and F. Kianfar, “A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty,” European Journal of Operational Research, vol. 181, no. 1, pp. 86–101, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. T. Murata, H. Ishibuchi, and H. Tanaka, “Genetic algorithms for flowshop scheduling problems,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 1061–1071, 1996. View at Publisher · View at Google Scholar · View at Scopus
  23. T. Murata, H. Ishibuchi, and H. Tanaka, “Multi-objective genetic algorithm and its applications to flowshop scheduling,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 957–968, 1996. View at Publisher · View at Google Scholar · View at Scopus
  24. C. A. Coello Coello, “Evolutionary multi-objective optimization: a historical view of the field,” IEEE Computational Intelligence Magazine, vol. 1, no. 1, pp. 28–36, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. H. Ishibuchi and T. Murata, “Multi-objective genetic local search algorithm,” in Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 119–124, May 1996. View at Scopus
  26. H. Ishibuchi and T. Murata, “A multi-objective genetic local search algorithm and its application to flowshop scheduling,” IEEE Transactions on Systems, Man and Cybernetics Part C, vol. 28, no. 3, pp. 392–403, 1998. View at Google Scholar · View at Scopus
  27. A. Jaszkiewicz, “Genetic local search for multi-objective combinatorial optimization,” European Journal of Operational Research, vol. 137, no. 1, pp. 50–71, 2002. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Jaszkiewicz, “On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-A comparative experiment,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 402–412, 2002. View at Publisher · View at Google Scholar · View at Scopus
  29. L. N. Xing, Y. W. Chen, K. W. Yang, F. Hou, X. S. Shen, and H. P. Cai, “A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem,” Engineering Applications of Artificial Intelligence, vol. 21, no. 8, pp. 1370–1380, 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. L. Xing, P. Rohlfshagen, Y. Chen, and X. Yao, “An evolutionary approach to the multidepot capacitated Arc routing problem,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 3, Article ID 5352249, pp. 356–374, 2010. View at Publisher · View at Google Scholar · View at Scopus
  31. L. N. Xing, Y. W. Chen, P. Wang, Q. S. Zhao, and J. Xiong, “A knowledge-based ant colony optimization for flexible job shop scheduling problems,” Applied Soft Computing Journal, vol. 10, no. 3, pp. 888–896, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. L. N. Xing, P. Rohlfshagen, Y. W. Chen, and X. Yao, “A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem,” IEEE Transactions on Systems, Man, and Cybernetics Part B, vol. 41, no. 4, pp. 1110–1123, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. J. D. Knowles and D. W. Corne, “M-PAES: a memetic algorithm for multiobjective optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '00), pp. 325–332, July 2000. View at Scopus
  34. V. Valls, S. Quintanilla, and F. Ballestín, “Resource-constrained project scheduling: a critical activity reordering heuristic,” European Journal of Operational Research, vol. 149, no. 2, pp. 282–301, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  35. V. Valls, F. Ballestín, and S. Quintanilla, “A population-based approach to the resource-constrained project scheduling problem,” Annals of Operations Research, vol. 131, pp. 305–324, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  36. V. Valls, F. Ballestín, and S. Quintanilla, “A hybrid genetic algorithm for the resource-constrained project scheduling problem,” European Journal of Operational Research, vol. 185, no. 2, pp. 495–508, 2008. View at Publisher · View at Google Scholar · View at Scopus
  37. H. Ishibuchi, T. Yoshida, and T. Murata, “Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling,” IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 204–223, 2003. View at Publisher · View at Google Scholar · View at Scopus
  38. J.-Y. Lin and Y.-P. Chen, “Analysis on the collaboration between global search and local search in memetic computation,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 5, pp. 608–623, 2011. View at Publisher · View at Google Scholar
  39. H. Ishibuchi, Y. Hitotsuyanagi, Y. Wakamatsu, and Y. Nojima, “How to choose solutions for local search in multiobjective combinatorial memetic algorithms,” in Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN '10), pp. 516–525, 2010. View at Publisher · View at Google Scholar
  40. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, New York, NY, USA, 2001.
  41. R. Kolisch, A. Sprecher, and A. Drexl, “Characterization and generation of a general class of resource-constrained project scheduling problem,” Management Science, vol. 41, no. 10, pp. 1693–1703, 1995. View at Google Scholar