Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 451090, 15 pages
http://dx.doi.org/10.1155/2013/451090
Research Article

Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

1School of Management, Huazhong University of Science and Technology, Wuhan 430074, China
2College of Economics and Management, Zhejiang University of Technology, Hangzhou 310023, China
3Technological Innovation and Enterprise Internationalization Research Center, Zhejiang Provincial Key Research Institute of Philosophy & Social Sciences, Hangzhou 310023, China
4Department of Environmental and Information Studies, Tokyo City University, Yokohama 224-0015, Japan
5School of Logistics, Southwest Jiaotong University, Chengdu 610031, China

Received 24 July 2013; Revised 29 August 2013; Accepted 30 August 2013

Academic Editor: Sabri Arik

Copyright © 2013 Yi Han 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.

How to Cite this Article

Yi Han, Ikou Kaku, Jianhu Cai, Yanlai Li, Chao Yang, and Lili Deng, “Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set,” Journal of Applied Mathematics, vol. 2013, Article ID 451090, 15 pages, 2013. doi:10.1155/2013/451090