Search Strategies for Scheduling Problems with Optional Activities

Roman Bartak

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.

Subjects: 1.12 Scheduling; 15.7 Search

Submitted: May 4, 2008

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.