Disjunctive Graph Algorithms for Resource Constrained Sequencing in Flow Shops: Maxium flow Time and Maximum Tardiness.
Abstract
The report has two purposes. The first is to review the recent literature on the resource constrained scheduling problem and in particular to discuss in some detail an algorithm of E. Balas to minimize maximum flow time. The second is to present an algorithm to minimize maximum tardiness using some new techniques in combination with the network structure of Balas. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1970
- Accession Number
- AD0715004
Entities
People
- Horace W. Heck
- Stephen D. Roberts
Organizations
- University of Florida