We study project scheduling in a competitive setting taking the perspective of a project manager with an adversary, using a Stackelberg game format. The project manager seeks to limit the adversary's opportunity to react to the project and therefore wants to manage the project in a way that keeps the adversary “in the dark” as long as possible while completing the project on time. We formulate and illustrate a new form of project management problem for secret projects where the project manager uses a combination of deception, task scheduling, and crashing to minimize the time between when the adversary initiates a response to the project to when the project is completed. We propose a novel mixed-integer linear programming formulation for the problem and determine characteristics of optimal schedules in this context. Using a detailed example of nuclear weapons development, we illustrate the interconnectedness of the deception, task scheduling, and crashing, and how these influence adversary behavior.
['Edieal J. Pinker', 'Joseph G. Szmerekovsky', 'Vera Tilson']
Technical Note---Managing a Secret Project