Search
Now showing items 1-2 of 2
Some problems in sequencing and scheduling utilizing branch and bound algorithms
(1988)
This dissertation deals with branch and bound algorithms which are applied to the two-machine flow-shop problem with sparse precedence constraints and the optimal sequencing and scheduling of multiple feedstocks in a batch ...
An algorithm for large-scale nonliner knapsack : problems and extensions
(1980)
In this dissertation, an algorithm was developed to solve large scale discrete nonlinear knapsack problems (NKP) with multiple resource constraints. The algorithm is essentially a dynamic programming technique in a sense ...