A random generator of resource-constrained multi-project network problems

Journal of Scheduling

Volumn 13, Issue 2, 2010, Pages 143-161

  Browning, Tyson R ^a   Yassine, Ali A ^b  

^a TEXAS CHRISTIAN UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Multi project scheduling; Network complexity; Project scheduling; Random network generator; Resource constraints

Indexed keywords

MULTI-PROJECT SCHEDULING; NETWORK COMPLEXITY; PROJECT SCHEDULING; RANDOM NETWORK; RESOURCE CONSTRAINT;

ELECTRIC NETWORK TOPOLOGY; FLOW MEASUREMENT;

SCHEDULING;

EID: 77952430773     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-009-0131-y     Document Type: Article

References (40)

1. Agrawal, M. K., Elmaghraby, S. E., & Herroelen, W. S. (1996). DAGEN: a generator of testsets for project activity nets. European Journal of Operational Research, 90(2), 376-382.
2. Alvarez-Valdés, R., & Tamarit, J. M. (1989). Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis. In R. Slowinski and J. Weglarz (Eds.), Advances in project scheduling (pp. 113-134). New York: Elsevier.
3. Bein, W. W., Kamburowski, J., and Stallmann, M. F. M. (1992). Optimal reduction of two-terminal directed acyclic graphs. SIAM Journal on Computing, 21(6), 1112-1129.
4. Browning, T. R., and Yassine, A. A. (2009). Resource-constrained multi project scheduling: priority rule performance revisited.TCU Neeley School of Business, Working Paper.
5. Dar-El, E. M. (1973). MALB-a heuristic technique for balancing large single-model assembly lines. AIIE Transactions, 5(4), 343-356.
6. Davis, E. W. (1975). Project network summary measures and constrained resource scheduling. IIE Transactions, 7(2), 132-142.
7. Davis, E. W., and Patterson, J. H. (1975). A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science, 21(8), 944-955.
8. De Reyck, B., and Herroelen, W. (1996). On the use of the complexity index as a measure of complexity in activity networks. European Journal of Operational research, 91(2), 347-366.
9. Demeulemeester, E., Dodin, B., and Herroelen, W. (1993). A random activity network generator. Operations Research, 41(5), 972-980.
10. Demeulemeester, E., and Herroelen, W. (1992). A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science, 38(12), 1803-1818.
11. Demeulemeester, E., Vanhoucke, M., and Herroelen, W. (2003). A random network generator for activity-on-the-node networks. Journal of Scheduling, 6(1), 13-34.
12. Elmaghraby, S. E. (1977). Activitynetworks:projectplanning and control by network models.New York:Wiley.
13. Elmaghraby, S. E., and Herroelen, W. S. (1980). On the measurement of complexity in activity networks. European Journal of Operational Research, 5(4), 223-234.
14. Gutiérrez, M., Duran, A., Alegre, D., and Sastrón, F. (2004). Hiergen: a computer tool for the generation of activity-on-the-node hierarchical project networks. In Proceedings ofthe computational science and its applications-ICCSA, Part III, Assisi, Italy (pp. 857-866).
15. Haberle, K., Burke, R., and Graves, R. (2000). A note on measuring parallelism in concurrent engineering. International Journal of Production Research, 38(8), 1947-1952.
16. Hartmann, S., and Kolisch, R. (2000). Experimental evaluation of state- of-the-art heuristics for the resource-constrained project scheduling problem. European Journal ofOperational Research, 127(2), 394-407.
17. Johnson, T. J. R. (1967). An algorithm for the resource-constrained project scheduling problem.PhDthesis,MIT.
18. Kaimann, R. A. (1974). Coefficient of network complexity. Management Science, 21(2), 172-177.
19. Kaimann, R. A. (1975). Coefficient of network complexity: erratum. Management Science, 21(10), 1211-1212.
20. Kao, E. P. C., and Queranne, M. (1982). On dynamic programming methods for assembly line balancing. Operations Research, 30(22), 375-390.
21. Kolisch, R., Sprecher, A., and Drexl, A. (1992). Characterization and generation of a general class of resource-constrained project scheduling problems. Kiel, Germany.
22. 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.
23. Kurtulus, I., and Davis, E. W. (1982). Multi-project scheduling: categorization of heuristic rules performance. Management Science, 28(2), 161-172. (Pubitemid 12523655)
24. Kurtulus, I. S., and Narula, S. C. (1985). Multi-project scheduling: analysis of project performance. IIE Transactions, 17(1), 58-65.
25. Liberatore, M. J., & Pollack-Johnson, B. (2003). Factors influencing the usage and selection of project management software. IEEE Transactions on Engineering Management, 50(2), 164-174.
26. Lova, A., and Tormos, P. (2001). Analysis of scheduling schemes and heuristic rules performance in resource-constrained multi-project scheduling. Annals ofOperations Research, 102(1-4), 263-286.
27. Maroto, C., Tormos, P., & Lova, A. (1999). The evolution of software quality in project scheduling. In J. Weglarz (Ed.), Project scheduling: recent models, algorithms and applications (pp. 239-259). Boston: Kluwer Academic.
28. Mastor, A. A. (1970). An experimental and comparative evaluation of production line balancing techniques. Management Science, 16(22), 728-746.
29. Pascoe, T. L. (1966). Allocation of resources-CPM. Revue Française de Recherche Opérationelle, 38, 31-38.
30. Patterson, J. H. (1976). Project scheduling: the effects of problem structure on heuristic performance. Naval Research Logistics, 23(1), 95-123.
31. Patterson, J. H. (1984). A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Management Science, 30(7), 854-867.
32. Payne, J. H. (1995). Management of multiple simultaneous projects: a state-of-the-art review. International Journal of Project Management, 13(3), 163-168.
33. Schwindt, C. (1995). A new problem generator for different resource - constrained project scheduling problems with minimal and maximal time lags. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, WIOR-Report-449.
34. Schwindt, C. (1996). Generation of resource-constrained project scheduling problems with minimal and maximal time lags. Institut fur Wirtschaftstheorie und Operations Research, Universitat Karlsruhe, Report WIOR-Report-489.
35. Schwindt, C. (1998). Generation of resource-constrained project scheduling problems subject to temporal constraints. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, Report WIOR-543.
36. Tavares, L. V. (1998). Advanced models for project management. Boston: Kluwer Academic.
37. Tavares, L. V., Ferreira, J. A., and Coelho, J. S. (1999). The risk of delay of a project in terms of the morphology of its network. European Journal of Operational Research, 119(2), 510-537.
38. Temperley, H. M. (1976). Graph theory and applications.Chichester: Ellis Horwood.
39. Thesen, A. (1977). Measures of the restrictiveness of project networks. Networks, 7, 193-208.
40. Vanhoucke, M., Coelho, J., Debels, D., and Tavares, L. V. (2004). On the morphological structure ofa network. Vlerick Leuven Gent Management School, Working Paper no. 2004/9.