Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set
This paper presents a shuffled frog leaping algorithm (SFLA) for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/451090 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832549495705960448 |
|---|---|
| author | Yi Han Ikou Kaku Jianhu Cai Yanlai Li Chao Yang Lili Deng |
| author_facet | Yi Han Ikou Kaku Jianhu Cai Yanlai Li Chao Yang Lili Deng |
| author_sort | Yi Han |
| collection | DOAJ |
| description | This paper presents a shuffled frog leaping algorithm (SFLA) for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved. |
| format | Article |
| id | doaj-art-321799df92dd409f8dcfd2ef49fc6dae |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-321799df92dd409f8dcfd2ef49fc6dae2025-02-03T06:11:03ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/451090451090Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson SetYi Han0Ikou Kaku1Jianhu Cai2Yanlai Li3Chao Yang4Lili Deng5School of Management, Huazhong University of Science and Technology, Wuhan 430074, ChinaDepartment of Environmental and Information Studies, Tokyo City University, Yokohama 224-0015, JapanCollege of Economics and Management, Zhejiang University of Technology, Hangzhou 310023, ChinaSchool of Logistics, Southwest Jiaotong University, Chengdu 610031, ChinaSchool of Management, Huazhong University of Science and Technology, Wuhan 430074, ChinaCollege of Economics and Management, Zhejiang University of Technology, Hangzhou 310023, ChinaThis paper presents a shuffled frog leaping algorithm (SFLA) for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.http://dx.doi.org/10.1155/2013/451090 |
| spellingShingle | Yi Han Ikou Kaku Jianhu Cai Yanlai Li Chao Yang Lili Deng Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set Journal of Applied Mathematics |
| title | Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set |
| title_full | Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set |
| title_fullStr | Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set |
| title_full_unstemmed | Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set |
| title_short | Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set |
| title_sort | shuffled frog leaping algorithm for preemptive project scheduling problems with resource vacations based on patterson set |
| url | http://dx.doi.org/10.1155/2013/451090 |
| work_keys_str_mv | AT yihan shuffledfrogleapingalgorithmforpreemptiveprojectschedulingproblemswithresourcevacationsbasedonpattersonset AT ikoukaku shuffledfrogleapingalgorithmforpreemptiveprojectschedulingproblemswithresourcevacationsbasedonpattersonset AT jianhucai shuffledfrogleapingalgorithmforpreemptiveprojectschedulingproblemswithresourcevacationsbasedonpattersonset AT yanlaili shuffledfrogleapingalgorithmforpreemptiveprojectschedulingproblemswithresourcevacationsbasedonpattersonset AT chaoyang shuffledfrogleapingalgorithmforpreemptiveprojectschedulingproblemswithresourcevacationsbasedonpattersonset AT lilideng shuffledfrogleapingalgorithmforpreemptiveprojectschedulingproblemswithresourcevacationsbasedonpattersonset |