Date

1970

Document Type

Thesis

Degree

Master of Science

Department

Industrial Engineering

First Adviser

Michael P. Groover

Abstract

Scheduling problems with scarce resources occur frequently in industry. There is a need for good solutions to these problems using efficient solution techniques. The generalized scheduling problem with scarce resources is formulated in terms of a zero-one integer programming problem. A computational procedure which optimally solves problems of this type is developed in this paper.

Share

COinS