An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
Authors:
- Chen FangCFChen Fang
- Ling WangLWLing Wang
- 1 May 2012
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (5) , 890-901
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (70871065, 60834004)
- Program for New Century Excellent Talents in University (NCET-10-0505)
- Doctoral Program Foundation of Institutions of Higher Education of China (20100002110014)
This publication has 37 references indexed in Scilit:
- Software project management with GAsInformation Sciences, 2007
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- A competitive genetic algorithm for resource-constrained project schedulingNaval Research Logistics (NRL), 1998
- Tabu search in audit schedulingEuropean Journal of Operational Research, 1998
- An investigation into the relationship of heuristic performance with network-resource characteristicsJournal of the Operational Research Society, 1997
- Efficient priority rules for the resource‐constrained project scheduling problemJournal of Operations Management, 1996
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computationEuropean Journal of Operational Research, 1996
- Scheduling of Project Networks by Job AssignmentManagement Science, 1991
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project SchedulingManagement Science, 1975