A pattern enumeration approach to the trim loss problem
This thesis examines the characteristics of practical one dimensional trim loss problems. As a result of the wide range of these characteristics, previous scheduling methods have only had a limited range of applicability. A heuristic approach is proposed, based on pattern enumeration, which can be u...
| Main Author: | |
|---|---|
| Published: |
University of Hull
1978
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.481894 |
| Summary: | This thesis examines the characteristics of practical one dimensional trim loss problems. As a result of the wide range of these characteristics, previous scheduling methods have only had a limited range of applicability. A heuristic approach is proposed, based on pattern enumeration, which can be used to develop scheduling methods for a reasonably wide class of trim loss problems. The effectiveness of the approach depends on its ability to avoid the intractable residual problems which normally arise towards the end of a heuristic scheduling procedure. The approach is used in three case studies, and the efficiency of the schedules generated is compared with that yielded by other methods. |
|---|