Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-17T21:32:38.161Z Has data issue: false hasContentIssue false
  • English
  • Français

A polarized adaptive schedule generation scheme for theresource-constrained project scheduling problem

Published online by Cambridge University Press:  15 May 2012

Reza Zamani
Reza Zamani*
Affiliation:
Building 39, SISAT, Faculty of Informatics, Wollongong University, Wollongong, 2522 NSW, Australia. reza@uow.edu.au
Get access

Abstract

This paper presents a hybrid schedule generation scheme for solving theresource-constrained project scheduling problem. The scheme, which is called the PolarizedAdaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely theparallel and serial schedule generation schemes. A polarizer parameter in the rangebetween zero and one indicates how similarly the PASS behaves like each of its two poles.The presented hybrid is incorporated into a novel genetic algorithm that neverdegenerates, resulting in an effective self-adaptive procedure. The key point of thisgenetic algorithm is the embedding of the polarizer parameter as a gene in the genomesused. Through this embedding, the procedure learns via monitoring its ownperformance and incorporates this knowledge in conducting the search process. Thecomputational experiments indicate that the procedure can produce optimal solutions for alarge percentage of benchmark instances.

Keywords

Project-schedulingresource-constrainedheuristics
Type
Research Article
Information
RAIRO - Operations Research , Volume 46 , Issue 1 , January 2012 , pp. 23 - 39
Copyright
© EDP Sciences, ROADEF, SMAI, 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

D.D. Bedworth and J.E. Bailey, Integrated production control systems-management, analysis, design. Wiley, New York (1982).
Bouleimen, K. and Lecocq, H., A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res. 149 (2003) 268–281. Google Scholar
Brucker, P. et al., A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107 (1998) 272–288. Google Scholar
Charon, I. and Hudry, O., The noising method : a new method for combinatorial optimization. Oper. Res. Lett. 14 (1993) 133–137. Google Scholar
Chen, R.-M. and Lo, S.-T., Using an enhanced ant colony system to solve resource-constrained project scheduling problem. Int. J. Comput. Sci. Netw. Secur. 6 (2006) 75–84. Google Scholar
Cho, J.H. and Kim, Y.D., A simulated annealing algorithm for resource constrained project scheduling problems. Oper. Res. Soc. 48 (1997) 736–744. Google Scholar
Chrétienne, P. and Sourd, F., PERT scheduling with convex cost functions. Theor. Comput. Sci. 292 (2003) 145–164. Google Scholar
De Reyck, B. and Herroelen, W., A branch-and-bound procedure for the resource-constrained project scheduling problem with generalised precedence relations. Eur. J. Oper. Res. 111 (1998) 152–174. Google Scholar
Demeulemeester, E. and Herroelen, W., A branch-and-bound procedure for multiple resource-constrained project scheduling problem. Manage. Sci. 38 (1992) 1803–1818. Google Scholar
Demeulemeester, E. and Herroelen, W., A new benchmark results for the resource-constrained project scheduling problem. Manage. Sci. 43 (1997) 1485–1492. Google Scholar
Dorndorf, U., Pesch, E. and Phan-Huy, T., A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math. Methods Oper. Res. 52 (2000) 413–439. Google Scholar
Hartmann, S., A competitive genetic algorithm for resource-constrained project scheduling. Nav. Res. Logist. 45 (1998) 733–750. Google Scholar
Hartmann, S., A self-adapting genetic algorithm for project scheduling under resource constraints. Nav. Res. Logist. 49 (2002) 433–448. Google Scholar
Hartmann, S. and Kolisch, R., Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127 (2000) 394–407. Google Scholar
Herroelen, W., De Reyck, B. and Demeulemeester, E., Resource-constrained project scheduling : A survey of recent developments. Comput. Oper. Res. 25 (1998) 279–302. Google Scholar
Jedrzejowicz, P. and Ratajczak-Ropel, E., Agent-based approach to solving the resource constrained project scheduling problem, in Adaptive and natural computing algorithms. Springer LNCS 4431 (2007) 480–487. Google Scholar
J. Kelley, The critical-path method : resource planning and scheduling, in Industrial scheduling, edited by J.F. Muth and G.L. Thompson. Prentice-Hall, New Jersey (1963) 347–365.
R. Kolisch, Project scheduling under resource constraints – efficient heuristics for several problem classes. Heidelberg Physica (1995).
Kolisch, R., Serial and parallel resource-constrained project scheduling methods revisited : Theory and computation. Eur. J. Oper. Res 90 (1996) 320–333. Google Scholar
Kolisch, R., Efficient priority rules for the resource-constrained project scheduling problem. J. Oper. Manage. 14 (1996) 179–192. Google Scholar
Kolisch, R. and Drexl, A., Adaptive search for solving hard project scheduling problems. Nav. Res. Logist. 43 (1996) 23–40. Google Scholar
Kolisch, R. and Hartmann, S., Experimental investigation of heuristics for resource-constrained project scheduling : An update. Eur. J. Oper. Res. 174 (2006) 23–37. Google Scholar
Kolisch, R. and Sprecher, A., PSPLIB – A project scheduling library. Eur. J. Oper. Res. 96 (1996) 205–216. Google Scholar
Li, K., and Willis, R., An iterative scheduling technique for resource-constrained project. scheduling. Eur. J. Oper. Res. 56 (1992) 370–379. Google Scholar
Mendes, J.J.M., Goncalves, J.F. and Resende, M.G.C., A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. 36 (2009) 92–109. Google Scholar
Mingozzi, A., et al., An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manage. Sci. 44 (1998) 714–729. Google Scholar
Möhring, R.H. et al. Solving project scheduling problems by minimum cut computations. Manage. Sci. 49 (2003) 330–350. Google Scholar
Mori, M. and Tseng, C., A genetic algorithm for multi-mode resource constrained project scheduling problem. Eur. J. Oper. Res. 100 (1997) 134–141. Google Scholar
Nazareth, T. et al., The multiple resource constrained project scheduling problem : A breadth-first approach. Eur. J. Oper. Res. 112 (1999) 347–366. Google Scholar
Orlin, J. et al., Very large scale neighborhood search. Int. Trans. Oper. Res. 7 (2000) 301–317. Google Scholar
Özdamar, L. and Ulusoy, G., A survey on the resource-constrained project scheduling problem. IIE Trans. 27 (1995) 574–586. Google Scholar
Palpant, M., Artigues, C. and Michelon, P., LSSPER : Solving the resource-constrained project scheduling problem with large neighbourhood search. Ann. Oper. Res. 131 (2004) 237–257. Google Scholar
Panagiotakopoulos, D., A CPM time-cost computational algorithm for arbitrary activity cost functions. INFOR 15 (1977) 183–195. Google Scholar
Sprecher, A., Scheduling resource-constrained projects competitively at modest memory requirement. Manage. Sci. 46 (2000) 710–723. Google Scholar
Tormos, P. and Lova, A., A competitive heuristic solution technique for resource-constrained project scheduling. Ann. Oper. Res. 102 (2001) 65–81. Google Scholar
Tseng, L.-Y. and Chen, S.-C., A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 175 (2006) 707–721. Google Scholar
Valls, V., Ballestin, F., and Quintanilla, S., A population-based approach to the resource-constrained project scheduling problem. Ann. Oper. Res. 131 (2004) 305–324. Google Scholar
Valls, V., Ballestin, F. and Quintanilla, S., Justification and RCPSP : A technique that pays. Eur. Oper. Res. 165 (2005) 375–386. Google Scholar
Zamani, R., An effective near-optimal state-space search method : an application to a scheduling problem. Artif. Intell. Rev. 22 (2004) 41–69. Google Scholar
Zamani, R., An accelerating two-layer anchor search with application to the resource-constrained project scheduling problem. IEEE Trans. Evol. Comput. 14 (2010) 975–984. Google Scholar
Zamani, R. and Lau, S.K., Embedding learning capability in lagrangean relaxation : An application to the travelling salesman problem. Eur. J. Oper. Res. 201 (2010) 82–88. Google Scholar