Network Models for Production Scheduling Problems with Convex Cost and Batch Processing.

摘要

This paper considers a class of production scheduling problems which can be modeled as network flow problems. The problems are addressed under the assumption that production occurs in batches. We also require that the cost function be convex and separable. The model applies for a number of well known production scheduling problems and will handle multiple products and multiple facilities. (Author)