Adeli, H., & Karim, A. (1997). Scheduling/cost optimization and neural dynamics model for con-struction. Journal of Construction Engineering and Management, 123(4), 450-458.
Alba, E., & Chicano, J. F. (2007). Software project management with GAs. Information Scienc-es, 177(11), 2380-2401.
Alcaraz, J., & Maroto, C. (2001). A robust genetic algorithm for resource allocation in project scheduling. Annals of operations Research, 102(1-4), 83-109.
Alcaraz, J., Maroto, C., & Ruiz, R. (2003). Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Socie-ty, 54(6), 614-626.
Al-Fawzan, M. A., & Haouari, M. (2005). A bi-objective model for robust resource-constrained project scheduling. International Journal of production economics, 96(2), 175-187.
Artigues, C., Michelon, P., & Reusser, S. (2003). Insertion techniques for static and dynamic re-source-constrained project scheduling. European Journal of Operational Research, 149(2), 249-267.
Baker, K. R., & Trietsch, D. (2013). Principles of sequencing and scheduling. John Wiley & Sons.
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained pro-ject scheduling: Notation, classification, models, and methods. European journal of operational research, 112(1), 3-41.
Betzig, H. M. (1964). Earlier payout through tight project scheduling and control. Journal of the American Oil Chemists' Society, 41(3), 58-58.
Boctor, F. F. (1990). Some efficient multi-heuristic procedures for resource-constrained project scheduling. European journal of operational research, 49(1), 3-13.
Boctor, F. F. (1993). Heuristics for scheduling projects with resource restrictions and several re-source-duration modes. The international journal of production research, 31(11), 2547-2558.
Boctor, F. F. (1996). Resource-constrained project scheduling by simulated anneal-ing. International Journal of Production Research, 34(8), 2335-2351.
Bouleimen, K. L. E. I. N., & Lecocq, H. O. U. S. N. I. (2003). A new efficient simulated anneal-ing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research, 149(2), 268-281.
Brucker, P., Knust, S., Schoo, A., & Thiele, O. (1998). A branch and bound algorithm for the re-source-constrained project scheduling problem1. European Journal of Operational Re-search, 107(2), 272-288.
Browning, T. R., & Yassine, A. A. (2010). Resource-constrained multi-project scheduling: Priority rule performance revisited. International Journal of Production Economics, 126(2), 212-228.
Cho, S. H., & Eppinger, S. D. (2005). A simulation-based process model for managing complex design projects. IEEE Transactions on engineering management, 52(3), 316-328.
Christofides, N., Alvarez-Valdés, R., & Tamarit, J. M. (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 29(3), 262-273.
Cesta, A., Oddi, A., & Smith, S. F. (2002). A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1), 109-136.
Damak, N., Jarboui, B., Siarry, P., & Loukil, T. (2009). Differential evolution for solving multi-mode resource-constrained project scheduling problems. Computers & Operations Re-search, 36(9), 2653-2659.
Davis, E. W. (1973). Project scheduling under resource constraints—historical review and catego-rization of procedures. AIIE Transactions, 5(4), 297-313.
Davis, E. W., & Patterson, J. H. (1975). A comparison of heuristic and optimum solutions in re-source-constrained project scheduling. Management science, 21(8), 944-955.
Debels, D., De Reyck, B., Leus, R., & Vanhoucke, M. (2006). A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operation-al Research, 169(2), 638-653.
Debels, D., & Vanhoucke, M. (2007). A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Operations Research, 55(3), 457-469.
Demeulemeester, E. L., & Herroelen, W. S. (1997). New benchmark results for the resource-constrained project scheduling problem. Management Science, 43(11), 1485-1492.
Demeulemeester, E., Vanhoucke, M., & Herroelen, W. (2003). RanGen: A random network gen-erator for activity-on-the-node networks. Journal of scheduling, 6(1), 17-38.
De Reyck, B. (1998). A branch-and-bound procedure for the resource-constrained project sched-uling problem with generalized precedence relations. European Journal of Operational Re-search, 111(1), 152-174.
Doersch, R. H., & Patterson, J. H. (1977). Scheduling a project to maximize its present value: A zero-one programming approach. Management Science, 23(8), 882-889.
Drexl, A. (1991). Scheduling of project networks by job assignment. Management Science, 37(12), 1590-1602.
Fleszar, K., & Hindi, K. S. (2004). Solving the resource-constrained project scheduling problem by a variable neighbourhood search. European Journal of Operational Research, 155(2), 402-413.
Gonçalves, J. F., Mendes, J. J., & Resende, M. G. (2008). A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Re-search, 189(3), 1171-1190.
Hartmann, S. (1998). A competitive genetic algorithm for resource‐constrained project schedul-ing. Naval Research Logistics (NRL), 45(7), 733-750.
Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Re-search, 127(2), 394-407.
Hartmann, S. (2001). Project scheduling with multiple modes: a genetic algorithm. Annals of Op-erations Research, 102(1-4), 111-135.
Hartmann, S. (2002). A self‐adapting genetic algorithm for project scheduling under resource con-straints. Naval Research Logistics (NRL), 49(5), 433-448.
Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of operational research, 207(1), 1-14.
Herroelen, W. S., Van Dommelen, P., & Demeulemeester, E. L. (1997). Project network models with discounted cash flows a guided tour through recent developments. European Journal of Operational Research, 100(1), 97-121.
Herroelen, W., De Reyck, B., & Demeulemeester, E. (1998). Resource-constrained project sched-uling: a survey of recent developments. Computers & Operations Research, 25(4), 279-302.
Herroelen, W., & Leus, R. (2004). Robust and reactive project scheduling: a review and classifica-tion of procedures. International Journal of Production Research, 42(8), 1599-1620.
Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research po-tentials. European journal of operational research, 165(2), 289-306.
Ip, W. H., Huang, M., Yung, K. L., & Wang, D. (2003). Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise. Computers & Operations Re-search, 30(2), 213-231.
Józefowska, J., Mika, M., Różycki, R., Waligóra, G., & Węglarz, J. (2001). Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research, 102(1-4), 137-155.
Levner, E., Kats, V., de Pablo, D. A. L., & Cheng, T. E. (2010). Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering, 59(2), 352-361.
Lee, J. K., & Kim, Y. D. (1996). Search heuristics for resource constrained project schedul-ing. Journal of the Operational Research Society, 47(5), 678-689.
Li, K. Y., & Willis, R. J. (1992). An iterative scheduling technique for resource-constrained pro-ject scheduling. European Journal of Operational Research, 56(3), 370-379.
Long, L. D., & Ohsato, A. (2008). Fuzzy critical chain method for project scheduling under re-source constraints and uncertainty. International Journal of Project Management, 26(6), 688-698.
Lova, A., Tormos, P., Cervantes, M., & Barber, F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, 117(2), 302-316.
Jarboui, B., Damak, N., Siarry, P., & Rebai, A. (2008). A combinatorial particle swarm optimiza-tion for solving multi-mode resource-constrained project scheduling problems. Applied Mathe-matics and Computation, 195(1), 299-308.
Katehakis, M. N., & Veinott Jr, A. F. (1987). The multi-armed bandit problem: decomposition and computation. Mathematics of Operations Research, 12(2), 262-268.
Kolisch, R. (1996). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90(2), 320-333.
Kolisch, R. (1996). Efficient priority rules for the resource-constrained project scheduling prob-lem. Journal of Operations Management, 14(3), 179-192.
Kolisch, R., & Drexl, A. (1997). Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE transactions, 29(11), 987-999.
Kolisch, R., & Sprecher, A. (1997). PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. European journal of operational re-search, 96(1), 205-216.
Kolisch, R., & Padman, R. (2001). An integrated survey of deterministic project schedul-ing. Omega, 29(3), 249-272.
Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European journal of operational research, 174(1), 23-37.
Koo, B., & Fischer, M. (2000). Feasibility study of 4D CAD in commercial construction. Journal of construction engineering and management, 126(4), 251-260.
Krauss, W. (1963). Über die Terminplanung großer Entwicklungsvorha-ben. Unternehmensforschung, 7(4), 151-168.
Kurtulus, I. B. R. A. H. I. M. S., & Davis, E. W. (1982). Multi-project scheduling: Categorization of heuristic rules performance. Management Science, 28(2), 161-172.
Merkle, D., Middendorf, M., & Schmeck, H. (2002). Ant colony optimization for resource-constrained project scheduling. IEEE transactions on evolutionary computation, 6(4), 333-346.
Mendes, J. J. D. M., Gonçalves, J. F., & Resende, M. G. (2009). A random key based genetic al-gorithm for the resource constrained project scheduling problem. Computers & Operations Re-search, 36(1), 92-109.
Mika, M., Waligóra, G., & Węglarz, J. (2005). Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and differ-ent payment models. European Journal of Operational Research, 164(3), 639-668.
Mingozzi, A., Maniezzo, V., Ricciardelli, S., & Bianco, L. (1998). An exact algorithm for the re-source-constrained project scheduling problem based on a new mathematical formula-tion. Management science, 44(5), 714-729.
Moorthy, R., & Teo, C. P. (2007). Berth management in container terminal: the template design problem. In Container Terminals and Cargo Systems (pp. 63-86). Springer, Berlin, Heidelberg.
Mori, M., & Tseng, C. C. (1997). A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research, 100(1), 134-141.
Moshman, J., Johnson, J., & Larsen, M. (1963, May). RAMPS: a technique for resource allocation and multi-project scheduling. In Proceedings of the May 21-23, 1963, spring joint computer conference (pp. 17-27). ACM.
Möhring, R. H., Schulz, A. S., Stork, F., & Uetz, M. (2003). Solving project scheduling problems by minimum cut computations. Management Science, 49(3), 330-350.
Musa, J. D. (1975). A theory of software reliability and its application. IEEE transactions on soft-ware engineering, (3), 312-327.
Nonobe, K., & Ibaraki, T. (2002). Formulation and tabu search algorithm for the resource con-strained project scheduling problem. In Essays and surveys in metaheuristics (pp. 557-588). Springer, Boston, MA.
Olofsson, T., Lee, G., Eastman, C., & Reed, D. (2007). Benefits and lessons learned of imple-menting building virtual design and construction (VDC) technologies for coordination of me-chanical, electrical, and plumbing.
Özdamar, L., & Ulusoy, G. (1995). A survey on the resource-constrained project scheduling prob-lem. IIE transactions, 27(5), 574-586.
Ozdamar, L. (1999). A genetic algorithm approach to a general category project scheduling prob-lem. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Re-views), 29(1), 44-59.
Patterson, J. H. (1984). A comparison of exact approaches for solving the multiple constrained re-source, project scheduling problem. Management science, 30(7), 854-867.
Rodammer, F. A., & White, K. P. (1988). A recent survey of production scheduling. IEEE trans-actions on systems, man, and cybernetics, 18(6), 841-851.
Saidi-Mehrabad, M., & Fattahi, P. (2007). Flexible job shop scheduling with tabu search algo-rithms. The International Journal of Advanced Manufacturing Technology, 32(5-6), 563-570.
Senouci, A. B., & Adeli, H. (2001). Resource scheduling using neural dynamics model of Adeli and Park. Journal of Construction Engineering and Management, 127(1), 28-34.
Sprecher, A., Hartmann, S., & Drexl, A. (1997). An exact algorithm for project scheduling with multiple modes. Operations-Research-Spektrum, 19(3), 195-203.
Sprecher, A., & Drexl, A. (1998). Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm1. European Journal of Operational Re-search, 107(2), 431-450.
Steyn, H. (2002). Project management applications of the theory of constraints beyond critical chain scheduling. International Journal of Project Management, 20(1), 75-80.
Talbot, F. B. (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management science, 28(10), 1197-1210.
Tormos, P., & Lova, A. (2001). A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research, 102(1-4), 65-81.
Tukel, O. I., Rom, W. O., & Eksioglu, S. D. (2006). An investigation of buffer sizing techniques in critical chain scheduling. European Journal of Operational Research, 172(2), 401-416.
Valls, V., Ballestı́n, F., & Quintanilla, S. (2005). Justification and RCPSP: A technique that pays. European Journal of Operational Research, 165(2), 375-386.
Valls, V., Ballestin, F., & Quintanilla, S. (2008). A hybrid genetic algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 185(2), 495-508.
Van Peteghem, V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201(2), 409-418.
Van de Vonder, S., Demeulemeester, E., Herroelen, W., & Leus, R. (2005). The use of buffers in project management: The trade-off between stability and makespan. International Journal of production economics, 97(2), 227-240.
Van de Vonder, S., Demeulemeester, E., & Herroelen, W. (2008). Proactive heuristic procedures for robust project scheduling: An experimental analysis. European Journal of Operational Re-search, 189(3), 723-733.
Wang, D., Yung, K. L., & Ip, W. H. (2001). A heuristic genetic algorithm for subcontractor selec-tion in a global manufacturing environment. IEEE Transactions on Systems, Man, and Cyber-netics, Part C (Applications and Reviews), 31(2), 189-198.
Węglarz, J., Józefowska, J., Mika, M., & Waligóra, G. (2011). Project scheduling with finite or in-finite number of activity processing modes–A survey. European Journal of operational re-search, 208(3), 177-205.
Yang, X. S., Deb, S., & Fong, S. (2011, July). Accelerated particle swarm optimization and sup-port vector machine for business optimization and applications. In International Conference on Networked Digital Technologies (pp. 53-66). Springer, Berlin, Heidelberg.
Zhang, H., Li, X., Li, H., & Huang, F. (2005). Particle swarm optimization-based schemes for re-source-constrained project scheduling. Automation in Construction, 14(3), 393-404.
Zhang, H., Li, H., & Tam, C. M. (2006). Particle swarm optimization for resource-constrained pro-ject scheduling. International Journal of Project Management, 24(1), 83-92.
Zhou, X., & Zhong, M. (2005). Bicriteria train scheduling for high-speed passenger railroad plan-ning applications. European Journal of Operational Research, 167(3), 752-771.
Zhou, X., & Zhong, M. (2007). Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B: Methodo-logical, 41(3), 320-341.