Publication at Faculty of Mathematics and Physics |
2008
Abstract
Scheduling problems typically deal with sequencing and resource allocation while the problem of activity selection is assumed to be resolved before scheduling. To increase flexibility of the scheduling systems in complex environments, it is possible to include decisions about other alternatives, for example about alternative process routes, in the scheduling problem.
This could be realized by assuming optional activities in the problem. The paper studies search strategies for solving scheduling problems with optional activities the search procedure assumes both sequencing decisions and selection among optional activities.