S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852)

The considered scheduling problem consists of obtaining the time at which each desired operation will begin its assignment, such that the constraints given by the distribution of the operations in types, groups and classes, the precedence relationsships and the resource availabilities are satisfied and the assignment cost is minimal. The author introduces a new type of special ordered sets to handle additional exclusivity constraints, precedence relationsships more complex than tree-like structures, semi-active schedules and also other resources in addition to machines. Computational procedures are outlined and some experience on some practical problems is reported.