Dynamic Programming Based Approach to Scheduling in the Fiber Optic Cable Industry

Show full item record

Title: Dynamic Programming Based Approach to Scheduling in the Fiber Optic Cable Industry
Author: Miller, Stuart Robert
Advisors: Dr. Thom Hodgson, Committee Chair
king@eos.ncsu.edu, Committee Member
Steven Jackson, Committee Co-Chair
Abstract: The purpose of this research has been to develop a scheduling tool for use in the fiber optic cable industry by using a modified dynamic programming partition problem or stock cutting problem based approach. Modifications include a restructuring of the partition type matrix by ranking weights in descending, rather than traditional ascending order, and a loosening of the criterion for optimality. The application of this work would be to reduce the number of setups needed in an early manufacturing phase by determining orders that can be combined together to be manufactured in continuous runs. Any combinations that are decided upon must be made in the context of the needs of complex downstream processes and attributes of the physical system restrict the maximum length of any combination of orders. The solution to this problem is a program, which has been developed in a VB and FORTRAN environment, to automate the exploration of possible decisions. Results obtained garner an overall 25% reduction in setup requirements compared to existing scheduling policies.
Date: 2004-05-17
Degree: MS
Discipline: Industrial Engineering
URI: http://www.lib.ncsu.edu/resolver/1840.16/1875

Files in this item

Files Size Format View
etd.pdf 399.1Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record