Master of Science
William A. Smith
The problem to which this thesis is addressed is known as the n by m scheduling problem. It can be briefly described as follows: n commodities are, each in a prescribed order, to be processed on one or more of m facilities which are initially idle, ready to provide service, and uncommited in the future. All ofthe n commodities are ready to be processed initially, and each must be processed for a prescribed period of time on each facility to which it is to be routed. A solution to the problem consists of a feasible specification of the time at which each facility will process each operation on each commodity routed to it.
Achey, John Aldrich, "The efficiency of a structural decision rule in a production scheduling algorithm" (1966). Theses and Dissertations. 3462.