V. Valls, M. Laguna, P. Lino, A. Pérez, and M. S. Quintanilla
Project Scheduling: Recent Models, Algorithms and Applications, Jan Weglarz (Ed.), Kluwer Academic Publishers, pp. 333-353 (1998)
In this chapter we address the problem of scheduling the activities of a resource-constrained project, some of which may be interrupted by an uncertain amount of time. The resources may be, for example, machines in a jobshop, computers with specialized software packages (as those needed for engineering designs), or highly specialized technicians. We consider that a project consists of a set of activities A = DA union SA. The DA subset consists of the deterministic activities, i.e., those with known duration. The SA subset consists of the stochastic activities, i.e., those that are interrupted for an uncertain amount of time. For an activity i in SA, the initial processing time is considered to be known, however, the length of the interruption and the final processing time are uncertain. We model the problem using the scenario-based approach known as robust optimization to deal with the uncertainty in the data. The proposed procedure is a scatter-tabu search hybrid that is shown to be effective on extensive computational experiments.
Full text
