Heuristic Methods for Gang-Rip Saw Arbor Design and Scheduling

Show simple item record

dc.contributor.advisor Yahya FATHI, Chair en_US
dc.contributor.advisor Richard H. BERNHARD, Member en_US
dc.contributor.advisor Matthias F. M. STALLMANN, Member en_US
dc.contributor.author Aksakalli, Vural en_US
dc.date.accessioned 2010-04-02T18:02:22Z
dc.date.available 2010-04-02T18:02:22Z
dc.date.issued 1999-11-14 en_US
dc.identifier.other etd-19991102-031914 en_US
dc.identifier.uri http://www.lib.ncsu.edu/resolver/1840.16/1227
dc.description.abstract This research considers the problem of designing and scheduling arbors for gang-rip saw systems. Such systems are typically used within the furniture manufacturing industry for processing lumber, where lumber boards are first ripped lengthwise into strips of different widths, and then, cut to the required lengths to be used in manufacturing.A saw with multiple cutting channels is used to perform this operation. This saw has fixed blades at specific positions on a rotating shaft which rips incoming lumber boards into required finished widths. The pattern of cutting channels (i.e., the setting of the blades) along the saw shaft is referred to as an ''arbor''.A typical instance of the problem consists of (1) a set of required finished widths and their corresponding demands, (2) a frequency distribution of lumber boards in the uncut stock, (3) a shaft length, and (4) a blade width. The objective is to design a set of (one or more) arbors and the corresponding quantity of lumber to run through each arbor, such that the total amount of waste generated is minimized while the demand is satisfied.In the research, we focus on solving the problem using only one arbor. First, we discuss the computational complexity of the problem and propose a total enumeration procedure which can be used to solve relatively small instances. Then, we develop algorithms based on heuristic approaches such as local improvement procedures, simulated annealing, and genetic algorithms. Our computational experiments indicate that a local improvement procedure with two nested loops, performing local search with a different neighborhood structure within each loop, gives very high quality solutions to the problem within very short execution times. en_US
dc.rights I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. en_US
dc.title Heuristic Methods for Gang-Rip Saw Arbor Design and Scheduling en_US
dc.degree.name MS en_US
dc.degree.level Master's Thesis en_US
dc.degree.discipline Operations Research en_US

Files in this item

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

This item appears in the following Collection(s)

Show simple item record