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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Yi Han, Ikou Kaku, Jianhu Cai, Yanlai Li, Chao Yang, Lili Deng
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!

Similar Items

Similar Items