A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- UNCW Author/Contributor (non-UNCW co-authors, if there are any, appear on document)
- Elmer S. Poliquit (Creator)
- Institution
- The University of North Carolina Wilmington (UNCW )
- Web Site: http://library.uncw.edu/
- Advisor
- John Karlof
Abstract: In this paper, the problem of minimizing the maximum number of open stacks
around a saw machine is addressed. A new heuristic and a branch-and-bound based
exact method for the problem are presented.
A method for solving the minimization of the maximum number of open stacks problem within a cutting process
PDF (Portable Document Format)
392 KB
Created on 1/1/2009
Views: 2044
Additional Information
- Publication
- Thesis
- A Thesis Submitted to the University of North Carolina at Wilmington in Partial Fulfillment of the Requirement for the Degree of Masters of Science
- Language: English
- Date: 2009
- Keywords
- Branch and bound algorithms, Production scheduling--Mathematical models
- Subjects
- Branch and bound algorithms
- Production scheduling -- Mathematical models