Sufficient Conditions For An Optimal Solution To The Problem Of Scheduling A Bottleneck Of An N-Stage Process

Abstract

This paper discusses the application of an algorithm for scheduling the bottleneck of an n-stage process involving multiple products to information systems development.  The algorithm is presented along with Pence’s Theorem, conditions sufficient for an optimal solution are presented, and the application of this algorithm and theorem to the development of information systems.