|
|||||
|
|
On the complexity of project scheduling to minimize exposed time |
|
| Authors: | Edieal Pinker Joseph Szmerekovsky Vera Tilson |
| Institution: | 1. School of Management, Yale University, New Haven, CT 06520, United States;2. Department of Management and Marketing, College of Business, North Dakota State University, Fargo, ND 58108, United States;3. Simon School of Business, University of Rochester, Rochester, NY 14627, United States |
| Abstract: | We consider project scheduling where the project manager’s objective is to minimize the time from when an adversary discovers the project until the completion of the project. We analyze the complexity of the problem identifying both polynomially solvable and NP-hard versions of the problem. The complexity of the problem is seen to be dependent on the nature of renewable resource constraints, precedence constraints, and the ability to crash activities in the project. |
| Keywords: | Complexity theory Project scheduling Secret project NP-complete Polynomial algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |