Abstract
The planning and scheduling activities are viewed profoundly important to generate successful plans and to maximize the utilization of scarce resources. Moreover, real life planning problems often involve several objectives that should be simultaneously optimized and real world environment is usually characterized by uncertain and incontrollable information. Thus, finding feasible and efficient plans is a considerable challenge. In this respect, theMulti-Objective Resource-Constrained Project- Scheduling problem (RCPSP) tries to schedule activities and allocate resources in order to find an efficient course of actions to help the project manager and to optimize several optimization criteria. In this research, we are developing a new method based on Ant System meta-heuristic and multi-objective concepts to raise the issue of the environment uncertainty and to schedule activities. We implemented and ran it on various sizes of the problem. Experimental results show that the CPU time is relatively short. We have also developed a lower bound for each objective in order to measure the degree of correctness of the obtained set of potentially efficient solutions. We have noticed that our set of potentially efficient solutions is comparable with these lower bounds. Thus, the average gap of the generated solutions is not far from the lower bounds.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Fawzan, M.A., Haouari, M.: A bi-objective model for robust resourceconstrained project scheduling. International Journal of production economics 96, 175–187 (2005)
Baar, T., Brucker, P., Knust, S.: Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project-Scheduling problem. In: Voss, S., Martello, S., Osman, I., Roucailor, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 1–18. Kluwer Academic Publishers, Dordrecht (1999)
Belfares, L., Klibi, W., Nassirou, L., Guitouni, A.: Multi-objectives Tabu Search based Algorithm for Progressive Resource Allocation. European Journal of Operational Research 177, 1779–1799 (2007)
Demeulemeester, E., Herroelen, W.: A branch and bound procedure for the multiple resource-constrained project-scheduling problems. Management Science 38, 1803–1818 (1992)
Kolisch, R., Hartmann, S.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project Scheduling problem. European Journal of Operational Research 127, 394–407 (2000)
Landa Silva, J.D., Burke, B.K., Petrovic, S.: An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling. In: Ben Abdelaziz, F., Krichen, S., Dridi, O. (eds.) Automated Scheduling, Optimization and Planning Research Group School of Computer Science and IT, University of Nottingham, UK, p. 730 (2003)
Merkle, D., Middendorf, M.: A New approach to solve permutation scheduling problems with Ant Colony Optimization. In: Applications of Evolutionary Computing: Procceedings of EvoWorkshops, pp. 484–493 (2001)
Merkle, D., Middendorf, M., Schmeck, H.: Ant Colony Optimization for Resource- Constrained Project Scheduling. In: Proceedings of the genetic and evolutionary computation conference, pp. 893–900 (2000)
Patterson, J.H., Huber, W.D.: A Horizon-Varying, Zero-One Approach to Project Scheduling. Management Science 20(6), 990–998 (1974)
Wei Feng, C., Liu, L., Scott Burns, A.: Using Genetic Algorithms to solve Construction time-cost Trade-Off problems. Journal of computing in civil engineering, 184–189 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben Abdelaziz, F., Krichen, S., Dridi, O. (2007). A Multiobjective Resource-Constrained Project-Scheduling Problem. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)