An artificial bee colony with random key for resource-constrained project scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6329 LNCS, Issue PART 2, 2010, Pages 148-157

  Shi, Yan Jun ^a   Qu, Fu Zhen ^a   Chen, Wang ^b   Li, Bo ^b  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b CHINA NORTH VEHICLE RESEARCH INSTITUTE   (China)

Author keywords

artificial bee colony; project scheduling; random key; resource saving

Indexed keywords

ARTIFICIAL BEE COLONIES; FEASIBLE SCHEDULE; MAKESPAN; PRIORITY RULES; PROBLEM REPRESENTATION; PROJECT SCHEDULING; RANDOM KEY; REAL TIME; RESOURCE CONSTRAINED PROJECT SCHEDULING; RESOURCE SAVINGS;

COMPUTER SIMULATION; SCHEDULING ALGORITHMS;

INTELLIGENT COMPUTING;

EID: 78649623407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15597-0_17     Document Type: Conference Paper

References (25)

1. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey (2005)
2. Karaboga, D., Akay, B.: A comparative study of Artificial Bee Colony algorithm. Applied Mathematics and Computation 214, 108-132 (2009)
3. Karaboga, D., Akay, B.: Artificial Bee Colony (ABC) Algorithm on training artificial neural networks. In: IEEE 15th Signal Processing and Communications Applications, Inst. of Elec. and Elec. Eng. Computer Society, Eskisehir, Turkey (2007)
4. Valls, V., Ballestín, F., Quintanilla, S.: Justification and RCPSP: A technique that pays. European Journal of Operational Research 165, 375-386 (2005) (Pubitemid 40206368)
5. Valls, V., Ballestín, F., Quintanilla, S.: A Population-Based Approach to the Resource-Constrained Project Scheduling Problem. Annals of Operations Research 131, 305-324 (2004)
6. Chen, W., Shi, Y.-j., Teng, H.-f., Lan, X.-p., Hu, L.-c.: An efficient hybrid algorithm for resource-constrained project scheduling. Information Sciences 180, 1031-1039 (2010)
7. Christofides, N., Alvarez-Valdes, R., Tamarit, J.M.: Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research 29, 262-273 (1987) (Pubitemid 17598425)
8. Kolisch, R., Hartmann, S.: Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. In: Weglarz, J. (ed.) Project Scheduling: Recent Models, Algorithms and Applications, pp. 147-178. Kluwer Academic Publishers, Berlin (1999)
9. Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 127, 394-407 (2000)
10. Debels, D., De Reyck, B., Leus, R., Vanhoucke, M.: A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 169, 638-653 (2006)
11. Sprecher, A., Kolisch, R., Drexl, A.: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80, 94-102 (1995)
12. Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research 174, 23-37 (2006) (Pubitemid 44866841)
13. Kolisch, R., Sprecher, A.: PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program. European Journal of Operational Research 96, 205-216 (1997)
14. Tormos, P., Lova, A.: Integrating heuristics for resource constrained project scheduling: One step forward. Technicalreport, Department of Statistics and Operations Research, Universidad Politecnica de Valencia (2003)
15. Debels, D., Vanhoucke, M.: A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem. Operations Research 55, 457-469 (2007)
16. Hartmann, S.: A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 45, 733-750 (1998)
17. Hartmann, S.: A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Research Logistics 49, 433-448 (2002)
18. Kochetov, Y., Stolyar, A.: Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies, Russia (2003)
19. Valls, V., Ballestin, F., Quintanilla, M.S.: A hybrid genetic algorithm for the RCPSP. Department of Statistics and Operations Research, University of Valencia (2003)
20. Tseng, L.-Y., Chen, S.-C.: A hybrid metaheuristic for the resource-constrained project scheduling problem. European Journal of Operational Research 175, 707-721 (2006)
21. Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Hansen, P. (ed.) Essays and Surveys in Metaheuristics, pp. 557-588. Kluwer Academic Publishers, Dordrecht (2001)
22. Mendes, J.J.M., Goncalves, J.F., Resende, M.G.C.: A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research 36, 92-109 (2009)
23. Palpant, M., Artigues, C., Michelon, P.: LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search. Annals of Operations Research 131, 237-257 (2004) (Pubitemid 39187382)
24. Valls, V., Quintanilla, S., Ballestín, F.: Resource-constrained project scheduling: A critical activity reordering heuristic. European Journal of Operational Research 149, 282-301 (2003)
25. Artigues, C., Michelon, P., Reusser, S.: Insertion techniques for static and dynamic resource-constrained project scheduling. European Journal of Operational Research 149, 249-267 (2003)