One-Machine Problems

Abstract

Scheduling multiple product types with unlimited production capacity is straightforwardly decomposed into a number of problems, each of which deals with a single product. The number of such problems is equal to the number of products to be scheduled. Such one-machine, one-product-type problems have been discussed in the previous part of the book. In contrast, scheduling multiple product types, with limited capacity, cannot be decomposed. This is because different products compete for the common capacity in a different, changing-in-time manner Because the multi-product, capacitated scheduling problem is much harder than the problems considered in the previous chapters, the objective of this chapter is to study the optimal behavior of production systems under only linear performance measures.