The problem of music programming in a FM-rádio station can be structured as that of producing a certain number of 4-music sequences with a given ordering by given classes, such as Brazilian instrumental music; Brazilian vocal music; Foreign instrumental music; Foreign vocal music. To select suitable sequences, one has to take account of two types of constraints. The first type is an objective one and deals with the time consumed by a sequence, which has to be between given maximum and minimum limits. The second type is subjective and depends on the programmer's preferences in what he/she thinks it is, or not, "good " to play a given type of recording before or after another one. The problem can be modelled by a graph where each music is a vertex, the vertex set being partitioned among the specified classes. Each 4-music sequence will then be associated to a path in the graph. An algorithm is described to find a set of sequences according to the given constraints.
Graph Theory; Operations Reserarch; Optimization