There are two opponents in a classic network interdiction problem, network owner/defender and interdictor/attacker. Each side has enough information about the other’s possible courses of action. While the network user wishes to run the network in an optimal way, the attacker with the limited resources tries to prevent the optimal operation of the network by interdicting the arcs/nodes of the network. In this study, we investigate project management in a competitive environment using a network interdiction approach. We assume that the project owner/manager strives to minimize the completion time of a Critical Path Method (CPM) based project while an opponent attempts to maximize the minimum completion time by inflicting some delays on project activities with available interdiction resources. Considering both discrete and continuous delay times, we develop two bi-level mixed-integer programming models for the interdictor. Using duality, we then convert the bi-level models to standard single-level models, which are solvable through standard optimization packages. We extend these models to find efficient solutions in terms of project completion time and interdiction resources from the interdictor’s perspective. In this respect, we develop an algorithm to find an efficient solution set for the interdictor. Next, from project manager’s standpoint, we discuss the earliest and latest scheduling times of activities in case of interdiction. Finally, we apply the developed techniques in a marketing project aiming at introducing a new product. The findings may enhance a better project management in an environment where an opponent can adversely affect the project management process by delaying some activities.
Keywords: Bi-level programming, project management, project scheduling, network modeling, network interdiction, integer programming
@article{RO_2021__55_S1_S365_0,
author = {Kasimo\u{g}lu, Fatih and Akg\"un, \.Ibrahim},
title = {Project management in a competitive environment: interdicting a {CPM} based project and its implications},
journal = {RAIRO. Operations Research},
pages = {S365--S384},
year = {2021},
publisher = {EDP-Sciences},
volume = {55},
doi = {10.1051/ro/2019089},
mrnumber = {4237384},
zbl = {1479.90120},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2019089/}
}
TY - JOUR AU - Kasimoğlu, Fatih AU - Akgün, İbrahim TI - Project management in a competitive environment: interdicting a CPM based project and its implications JO - RAIRO. Operations Research PY - 2021 SP - S365 EP - S384 VL - 55 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2019089/ DO - 10.1051/ro/2019089 LA - en ID - RO_2021__55_S1_S365_0 ER -
%0 Journal Article %A Kasimoğlu, Fatih %A Akgün, İbrahim %T Project management in a competitive environment: interdicting a CPM based project and its implications %J RAIRO. Operations Research %D 2021 %P S365-S384 %V 55 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2019089/ %R 10.1051/ro/2019089 %G en %F RO_2021__55_S1_S365_0
Kasimoğlu, Fatih; Akgün, İbrahim. Project management in a competitive environment: interdicting a CPM based project and its implications. RAIRO. Operations Research, Tome 55 (2021), pp. S365-S384. doi: 10.1051/ro/2019089
[1] , and , Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993). | MR | Zbl
[2] , and , The multi-terminal maximum flow network interdiction problem. Eur. J. Oper. Res. 211 (2011) 241–251. | MR | Zbl | DOI
[3] and , Multi-level programming and conflict resolution. Eur. J. Oper. Res. 51 (1991) 233–247. | Zbl | DOI
[4] , A network interdiction model for hospital infection control. Comput. Biol. Med. 17 (1987) 413–422. | DOI
[5] , and , A robust model for a leader-follower competitive facility location problem in a discrete space. Appl. Math. Model. 37 (2013) 62–71. | MR | Zbl | DOI
[6] , and , Linear Programming and Network Flows. John Wiley & Sons, New Jersey (2005). | MR | Zbl
[7] , , , On the power of randomization in network interdiction. Oper. Res. Lett. 44 (2016) 114–120. | MR | Zbl | DOI
[8] , , , and , A two-sided optimization for theater-ballistic missile defense. Oper. Res. 53 (2005) 745–763. | MR | Zbl | DOI
[9] , , and , On the complexity of delaying an adversary’s project. In: The Next Wave in Computing, Optimization and Decision Technologies. Springer, New York (2005) 3–17.
[10] , , and , Defending critical infrastructure. Interfaces 36 (2006) 530–544. | DOI
[11] , , , and , Interdicting a nuclear weapons project. Oper. Res. 57 (2009) 866–877. | Zbl | DOI
[12] , and , Solving the bilevel facility location problem under preferences by a stackelberg-evolutionary algorithm. Math. Prob. Eng. 2014 (2014) 430243. | MR | Zbl | DOI
[13] and , Hardness and approximation for network flow interdiction. Networks 69 (2017) 378–387. | MR | Zbl | DOI
[14] , and , Identifying critical infrastructure: the median and covering facility interdiction problems. Ann. Assoc. Am. Geographers 94 (2004) 491–502. | DOI
[15] and , Most vital links and nodes in weighted networks. Oper. Res. Lett. 1 (1982) 157–160. | MR | Zbl | DOI
[16] , Computational methods for deterministic and stochastic network interdiction problems. Masters thesis. Naval Post Graduate School, Monterey, CA (1995).
[17] , and , Stochastic network interdiction. Oper. Res. 46 (1998) 184–197. | Zbl | DOI
[18] and , The complexity of computing a robust flow. Preprint arXiv:1704.08241 (2017). | MR | Zbl
[19] , , and , Bilevel multiobjective programming applied to water resources allocation. Math. Prob. Eng. 2013 (2013) 837919. | MR | DOI
[20] and , Flows in Networks. Princton University, Princton, NJ (1962). | MR | Zbl
[21] and , Maximizing the minimum source-sink path subject to a budget constraint. Math. Prog. 13 (1977) 116–118. | MR | Zbl | DOI
[22] GAMS Development Corporation, General Algebraic Modeling System (GAMS). Rev 146 (2006).
[23] , and , Optimal interdiction policy for a flow network. Nav. Res. Logist. Q. 18 (1971) 37–45. | MR | Zbl | DOI
[24] , A problem in network interdiction. Nav. Res. Logist. Q. 25 (1978) 711–713. | Zbl | DOI
[25] , A Counter Capacity Network Interdiction Model. Report R-611-PR, RAND Corporation: Santa Monica, CA (1971).
[26] , System interdiction and defense. Doctoral dissertation Naval Postgraduate School, Monterey, CA (1999).
[27] and , Shortest-path network interdiction. Networks 40 (2002) 97–111. | MR | Zbl | DOI
[28] and , A simulated annealing algorithm to the stochastic network interdiction problem. In: Proceedings of IEEE International Conference on Industrial Engineering and Engineering Management (2016) 230–233.
[29] , , , and , Bi-level programming and applications. Math. Prob. Eng. 2 (2015) 1–16. | MR | Zbl | DOI
[30] , , and , Analyzing vulnerability of power systems with continuous optimization formulations. IEEE Trans. Network Sci. Eng. 3 (2016) 132–146. | MR | DOI
[31] , and , Determining the most vital link in a flow network. Nav. Res. Logist. Q. 17 (1971) 497–502. | MR | Zbl | DOI
[32] , and , A survey on robustness in railway planning. Eur. J. Oper. Res. 266 (2018) 1–15. | MR | Zbl | DOI
[33] , and , The most vital arcs in the shortest path problem. Oper. Res. Lett. 8 (1989) 223–227. | MR | Zbl | DOI
[34] and , Optimal interdiction of a supply network. Nav. Res. Logist. Q. 17 (1970) 261–268. | Zbl | DOI
[35] and , Project management: a managerial approach. John Wiley & Sons, Inc., New Jersey (2003).
[36] , and , Finding the most vital links in flow networks. Manage. Sci. 21 (1975) 531–539. | MR | Zbl | DOI
[37] and , A bi-objective approach for shortest path network interdiction. Comput. Ind. Eng. 59 (2010) 232–240. | DOI
[38] and , Solving the bi-objective maximum flow network interdiction problem. INFORMS J. Comput. 19 (2007) 175–184. | MR | Zbl | DOI
[39] , and , Analysis of electric grid security under terrorist threat. IEEE Trans. Power Syst. 19 (2004) 905–912. | DOI
[40] , and , Worst case interdiction analysis of large-scale electric power grids. IEEE Trans. Power Syst. 24 (2009) 96–104. | DOI
[41] and , On the Stackelberg strategy in nonzero-sum games. J. Optim. Theory App. 11 (1973) 533–555. | MR | Zbl | DOI
[42] , Basic interdiction models. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Hoboken (2011).
[43] , , and , Probabilistic failure-identification for power systems. Networks 71 (2018) 302–321. | MR | DOI
[44] , Multiple Criteria Decision Making in Industry. Elsevier, Amsterdam (1988).
[45] , The Theory of the Market Economy. William Hodge & Co., London, German (1952).
[46] , , , and , Shortest Path network interdiction with goal threshold. IEEE Access 6 (2018) 29332–29343. | DOI
[47] and , Linear bi-level programming problems – a review. J. Oper. Res. Soc. 42 (1991) 125–133. | Zbl
[48] , Operations Research Applications and Algorithms. Brooks/Cole, Cengage Learning, Belmont (2004).
[49] , Some Methods for Determining the Most Vital Link in a Railway Network. Rand Corporation, Santa Monica, CA (1963).
[50] , Removing arcs from a network. Oper. Res. 12 (1964) 934–940. | MR | Zbl | DOI
[51] , Deterministic network interdiction. Math. Comput. Model. 17 (1993) 1–18. | MR | Zbl | DOI
[52] , Bi-level network interdiction models: formulations and solutions. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Hoboken (2011). | DOI
[53] and , Analysis of budget for interdiction on multicommodity network flows. J. Global Optim. 67 (2016) 1–31. | MR | Zbl
Cité par Sources :
