Title page for ETD etd-02022010-020107

Type of Document Master's Thesis
Author Hogge, Jerome W. III
URN etd-02022010-020107
Title Two-dimensional stock cutting processes :an algorithm to optimize two-dimensional stock cutting at New River Valley Workshop, Inc.
Degree Master of Science
Department Industrial and Systems Engineering
Advisory Committee
Advisor Name Title
Kemmerling, Paul T. Jr. Committee Chair
Agee, Marvin H. Committee Member
Sarin, Subhash C. Committee Member
  • Manufacturing processes
Date of Defense 1991-12-05
Availability restricted

This research addresses a two-dimensional stock cutting problem encountered at the New River Valley Workshop (NRV), Inc. in Radford, VA. This research considers recent literature on two-dimensional stock cutting techniques, pattern generating methods, solution approaches, and practical problem considerations in addressing the NRV cutting problem. Linear Programming analysis is applied to NRV's two-dimensional cutting problem. A computer-based implementation of the LP solution methodology is developed and used to solve NRV cutting problems. Test data and sample problems are used to demonstrate the efficiency, speed and accuracy of the computer-based system. Solution results from test data are compared to current NRV performance, illustrating the significant improvements in solution time and stock utilization that can be attained through the use of LP techniques and this computer-based implementation.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
[VT] LD5655.V851_1991.H633.pdf 2.28 Mb 00:10:34 00:05:26 00:04:45 00:02:22 00:00:12
[BTD] next to an author's name indicates that all files or directories associated with their ETD are accessible from the Virginia Tech campus network only.

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.