1 |
Kolisch, R., Sprecher, A., and Drexl, A. (1995) Characterization and generation of a general class of resource- constrained project scheduling problems, Management Science, 41(10), 1693-1703.
DOI
ScienceOn
|
2 |
Wuliang, P. and Chengen, W. A. (2009) Multi-mode resource-constrained discrete time-cost tradeoff problem and its genetic algorithm based solution, International Journal of Project Management, 27 (6), 600-609.
DOI
ScienceOn
|
3 |
Moscato, P. (1989) On evolutions, search, optimization, genetic algorithms and martial arts: toward memetic algorithms, Technical Report, Caltech Concurrent Computer Program Report, California Institute Technology, Pasadena, CA.
|
4 |
Moscato, P. (1999) Memetic algorithms: a short introduction, In D. Corne, F. Glover and M. Dorigo, eds. New Ideas in Optimization, McGraw-Hill, 219-234.
|
5 |
Patterson, J. H. (1984) A comparison of exact procedures for solving the multiple constrained resource project scheduling problem, Management Science, 30(7), 854-867.
DOI
ScienceOn
|
6 |
Prabuddha, D. E., Dunne, E. J., and Ghosh, J. B. (1997) Complexity of the discrete time-cost tradeoff problem for project networks, Operations research, 45(2), 302-306.
DOI
ScienceOn
|
7 |
Li, K.Y. and Willis, R. J. (1992) An iterative scheduling technique for resource-constrained project scheduling, European Journal of Operational Research, 56(3), 370-379.
DOI
ScienceOn
|
8 |
Kolisch, R. and Drexl, A. (1997) Local search for nonpreemptive multi-mode resource-constrained project scheduling, IIE Transactions, 29(11), 987-999.
|
9 |
Kolisch, R. and Hartmann, S. (2006) Experimental investigation of heuristics for resource-constrained project scheduling: An update, European Journal of Operational Research, 174(1), 23-37.
DOI
ScienceOn
|
10 |
Kolisch, R. and Sprecher, A. (1997) PSPLIB–A project scheduling problem library, European journal of Operational Research, 96(1), 205-216.
DOI
ScienceOn
|
11 |
Hamimes, Y. Y., Lasdon, L. S., and Wismer, D. A. (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Transactions on Systems, Man and Cybernaties, 1(3), 296-297.
DOI
|
12 |
Herroelen, W., Reyck, B. D., and Demeulemeester, E. (1998) Resource-constrained project scheduling: A survey of recent developments, Computers and Operations Research, 25(4), 279-302.
DOI
ScienceOn
|
13 |
Hsu, C. C. and Kim, D. S. (2005) A new heuristic for the multi-mode resource investment problem, Journal of the Operational Research Society, 56(4),406-413.
DOI
ScienceOn
|
14 |
Demeulemeester, E., De Reyck, B., Foubert, B., Herroeleon, W., and Vanhoucke, M. (1998) New computational results on the discrete time/cost trade-off problem in project networks, Journal of the Operational Research Society, 49(11), 1153-1163.
DOI
|
15 |
Demeulemeester, E. L., and Herroelen, W. S. (2002) Project scheduling: A Research Handbook, Norwell, MA: Kluwer.
|
16 |
Halman, N., Li, C. L., and Simchi-Levi, D. (2009) Fully polynomial-time approximation schemes for timecost tradeoff problems in series-parallel project networks, Operations Research Letters, 37(4), 239-244.
|
17 |
Buriol, L., Franca, P. M., and Moscato, P. (2004) A new memetic algorithm for the asymmetric traveling salesman problem, Journal of Heuristics, 10(5), 483-506.
DOI
|
18 |
De Reyck, B. (1998) Scheduling Projects with Generalized Precedence Relations-Exact and Heuristic Procedures, Ph.D. Dissertation, Department of Applied Economics, Katholieke University Leuven.
|
19 |
Bouleimen, K. and Lecocq, H. (2003) A new efficient simulated annealing algorithm for the resourceconstrained project scheduling problem and its multiple mode version, European Journal of Operational Research, 149(2), 2684-281.
|
20 |
Brucker, P., Drexl, A., Mohring, R., Neumann, K., and Pesch, E. (1999) Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, 112(1), 3-41.
DOI
ScienceOn
|
21 |
Vanhoucke, M., Demeulemeester, E., and Herroelen, W. (2002) Discrete time/cost trade-offs in project scheduling with time-switch constraints, Journal of the Operations Research Society, 53(7), 741-751.
DOI
ScienceOn
|
22 |
Sprecher, A. (1994) Resource-constrained project sche-duling -exact methods for the multi-mode case, Lecture Notes in Economics and Mathematics, No 409, Springer, Berlin, Germany.
|
23 |
Talbot, F. B. (1982) Resource constrained project scheduling with time-resource tradeoffs: the nonpreemptive case, Management Science, 28(10), 1197- 1210.
DOI
ScienceOn
|
24 |
Tormos, P. and Lova, A. (2001) A competitive heuristic solution technique for resource-constrained project scheduling, Annals of Operations Research, 102(1- 4), 65-81.
DOI
|
25 |
Tormos, P. and Lova, A. (2003) An efficient multi-pass heuristic for project scheduling with constrained resources, International Journal of Production Research, 41(5), 1071-1086.
DOI
ScienceOn
|
26 |
Valls, V., Ballestin, F., and Quintanilla, S. (2005) Justification and RCPSP: a technique that pays, European Journal of Operational Research, 165(2), 375-386.
DOI
ScienceOn
|
27 |
Weglarz, J. (1999) Project Scheduling: Recent models, Algorithms and Applications, Norwell, MA: Kluwer.
|
28 |
Yamashita, D. S. Armentano, V. A., and Laguna, M. (2006) Scatter search for project scheduling with resource availability cost, European Journal of Operational Research, 169(2), 623-637.
DOI
ScienceOn
|
29 |
Ljubic, I. and Raidl, G. R. (2003) A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs, Journal of Heuristics, 9(5), 401-427.
DOI
|