A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem

References

• [1] Abdolshah M (2014) A review of resource-constrained project scheduling problems (RCPSP) approaches and solutions. Internat. Trans. J. Engrg. Management Appl. Sci. Tech. 5(4):253–286.Google Scholar
• [2] Al-Sharrah G (2010) Ranking using the Copeland score: A comparison with the Hasse diagram. J. Chemical Inform. Model. 50(5):785–791.Crossref, Google Scholar
• [3] Alvarez-Valdés R, Tamarit JM (1989) Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis. Słowiński R, Węglarz J, eds. Advances in Project Scheduling (Elsevier, Amsterdam), 113–134.Google Scholar
• [4] Brightwell G, Winkler P (1991) Counting linear extensions. Order 8(3):225–242.Crossref, Google Scholar
• [5] Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1):3–41.Crossref, Google Scholar
• [6] Carlsen L (2017) An alternative view on distribution keys for the possible relocation of refugees in the European Union. Soc. Indicators Res. 130(3):1147–1163.Crossref, Google Scholar
• [7] Coelho J, Vanhoucke M (2018) An exact composite lower bound strategy for the resource-constrained project scheduling problem. Comput. Oper. Res. 93(May):135–150.Crossref, Google Scholar
• [8] Coelho J, Vanhoucke M (2020) Going to the core of hard resource-constrained project scheduling instances. Comput. Oper. Res. 121(September):104976.Crossref, Google Scholar
• [9] De Loof K, De Meyer H, De Baets B (2006) Exploiting the lattice of ideals representation of a poset. Fundamenta Inform. 71(2–3):309–321.Google Scholar
• [10] De Reyck B, Herroelen W (1996) On the use of the complexity index as a measure of complexity in activity networks. Eur. J. Oper. Res. 91(2):347–366.Crossref, Google Scholar
• [11] Demeulemeester E, Herroelen W (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. 38(12):1803–1818.Link, Google Scholar
• [12] Habib M, Paul C (2005) A simple linear time algorithm for cograph recognition. Discrete Appl. Math. 145(2):183–197.Crossref, Google Scholar
• [13] Habib M, Paul C (2010) A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1):41–59.Crossref, Google Scholar
• [14] Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1):1–14.Crossref, Google Scholar
• [15] Herroelen W, De Reyck B (1999) Phase transitions in project scheduling. J. Oper. Res. Soc. 50(2):148–156.Crossref, Google Scholar
• [16] Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: A survey of recent developments. Comput. Oper. Res. 25(4):279–302.Crossref, Google Scholar
• [17] Icmeli O, Erenguc SS, Zappe CJ (1993) Project scheduling problems: A survey. Internat. J. Oper. Prod. Management 13(11):80–91.Crossref, Google Scholar
• [18] Knuth DE (1998) The Art of Computer Programming: Volume 3: Sorting and Searching, 2nd ed. (Addison-Wesley, Upper Saddle River, NJ).Google Scholar
• [19] Kolisch R (1995) Project Scheduling Under Resource Constraints: Efficient Heuristics for Several Problem Classes (Springer Science & Business Media, New York).Crossref, Google Scholar
• [20] Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: An update. Eur. J. Oper. Res. 174(1):23–37.Crossref, Google Scholar
• [21] Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29(3):249–272.Crossref, Google Scholar
• [22] Kolisch R, Sprecher A (1997) PSPLIB—A project scheduling problem library: OR software—ORSEP Operations Research Software Exchange Program. Eur. J. Oper. Res. 96(1):205–216.Crossref, Google Scholar
• [23] Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Management Sci. 41(10):1693–1703.Link, Google Scholar
• [24] Möhring RH (1989) Computationally tractable classes of ordered sets. Rival I, ed. Algorithms and Order (Kluwer Academic Publishers, Dordrecht, Netherlands), 105–193.Crossref, Google Scholar
• [25] Monma CL, Sidney JB (1987) Optimal sequencing via modular decomposition: Characterization of sequencing functions. Math. Oper. Res. 12(1):22–31.Link, Google Scholar
• [26] Patterson JH (1984) A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Management Sci. 30(7):854–867.Link, Google Scholar
• [27] Sidney JB, Steiner G (1986) Optimal sequencing by modular decomposition: Polynomial algorithms. Oper. Res. 34(4):606–612.Link, Google Scholar
• [28] Sprecher A (2000) Scheduling resource-constrained projects competitively at modest memory requirements. Management Sci. 46(5):710–723.Link, Google Scholar
• [29] Stork F, Uetz M (2005) On the generation of circuits and minimal forbidden sets. Math. Programming 102(1):185–203.Crossref, Google Scholar
• [30] Thesen A (1977) Measures of the restrictiveness of project networks. Networks 7(3):193–208.Crossref, Google Scholar
• [31] Vanhoucke M, Coelho J (2018) A tool to test and validate algorithms for the resource-constrained project scheduling problem. Comput. Indust. Engrg. 118(April):251–265.Crossref, Google Scholar
• [32] Vanhoucke M, Coelho J, Batselier J (2016) An overview of project data for integrated project management and control. J. Modern Project Management 3(3):6–21.Google Scholar
• [33] Vanhoucke M, Coelho J, Debels D, Maenhout B, Tavares LV (2008) An evaluation of the adequacy of project network generators with systematically sampled networks. Eur. J. Oper. Res. 187(2):511–524.Crossref, Google Scholar