A Method for Single Facility Multiple Products Scheduling

The single facility multiple products scheduling problem is formulated into a multiperiod mathematical programming model with zero-one variables. An algorithm to solve the scheduling problem by using the concept of state vectors of dynamic programming is described. An example of application of the model and the algorithm is also presented. It has been found that a suitable selection of a state vector reduces greatly the dimensionality of the problem