A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. (English) Zbl 1121.90062

Summary: A genetic algorithm for solving a class of project scheduling problems, called Resource investment problem, is presented. Tardiness of project is permitted with defined penalty. Elements of algorithm such as chromosome structure, unfitness function, crossover, mutation, immigration and local search operations are explained. The performance of this genetic algorithm is compared with the performance of other published algorithms for resource investment problem. Also 690 problems are solved and their optimal solutions are used for the performance tests of the genetic algorithm. The tests results are quite satisfactory.


90B35 Deterministic scheduling theory in operations research
90C59 Approximation methods and heuristics in mathematical programming


Full Text: DOI


[1] Baker, K., Introduction to sequencing and scheduling, (1974), John Wiely and Sons, Inc
[2] Bedworth, D.D.; Bailey, J.E., Integrated production control systems – management, analysis, design, (1982), Wiley New York
[3] Brucker, P.; Drexl, A.; Möhring, R.H.; Neumann, K.; Pesch, E., Resource-constrained project scheduling: notation, classification, models, and methods, European journal of operational research, 112, 3-41, (1999) · Zbl 0937.90030
[4] Demeulemeester, E.L., Minimizing resource availability costs in time limited project networks, Management science, 41, 1590-1598, (1995) · Zbl 0861.90071
[5] Demeulemeester, E.L.; Herroelen, W., A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Management science, 38, 1803-1818, (1992) · Zbl 0761.90059
[6] Drexl, A.; Kimms, A., Optimization guided lower & upper bounds for the resource investment problem, Journal of the operational re search society, 52, 340-351, (2001) · Zbl 1131.90378
[7] Hartmann, S., A competitive genetic algorithm for resource-constrained project scheduling, Naval research logistics, 45, 733-750, (1998) · Zbl 0936.90024
[8] Kelley, J.E., The critical path method: resources planning and scheduling, (), 347-365
[9] Kimms, A., 2002. Personal communication.
[10] Kolisch, R., Serial and parallel resource constrained project scheduling methods revisited: theory and computation, European journal of operational research, 90, 320-333, (1996) · Zbl 0916.90151
[11] Kolisch, R.; Hartmann, S., Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis, (), 147-178
[12] Kolisch, R.; Sprecher, A., PSBLIB - A project scheduling problem library, European journal of operational research, 96, 205-216, (1997) · Zbl 0947.90587
[13] Kolisch, R.; Sprecher, A.; Drexl, A., Characterization and generation of a general class of resource-constrained project scheduling problems, Management science, 41, 1693-1703, (1995) · Zbl 0870.90070
[14] Möhring, R.H., Minimizing costs of resource requirements in project networks subject to a fix completion time, Operations research, 32, 89-120, (1984) · Zbl 0531.90049
[15] Nuamann, K.; Schwindt, C.; Zimmerman, J., Project scheduling with time windows and scarce resources, (2003), Springer Berlin
[16] Nübel, H., The resource renting problem subject to temporal constraints, OR spektrum, 23, 574-586, (2001) · Zbl 0985.90041
[17] Pritsker, A.A.B.; Watters, L.J.; Wolfe, P.M., Multi-project scheduling with limited resources, Management science, 16, 93-108, (1969)
[18] Schwindt, C., 1996, Generation of resource constrained scheduling problems with minimal and maximal time lags, Report WIOR-489, Universität Karlsruhe.
[19] 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) · Zbl 0927.90054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.