ON A PATTERN SEQUENCING PROBLEM TO MINIMIZE THE MAXIMUM NUMBER OF OPEN STACKS

Authors
YANASSE HH
Citation
Hh. Yanasse, ON A PATTERN SEQUENCING PROBLEM TO MINIMIZE THE MAXIMUM NUMBER OF OPEN STACKS, European journal of operational research, 100(3), 1997, pp. 454-463
Citations number
9
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
European journal of operational research → ACNP
ISSN journal
03772217
Volume
100
Issue
3
Year of publication
1997
Pages
454 - 463
Database
ISI
SICI code
0377-2217(1997)100:3<454:OAPSPT>2.0.ZU;2-S
Abstract
Consider a wood cutting setting where different panels have to be cut from large boards. Each cut panel size is put into a stack which remai ns opened until the last panel of that size is cut. The problem consid ered here deals with the sequencing of the patterns in order to minimi ze the maximum number of open stacks during the production run. A bran ch and bound method for solving this problem is presented which uses a greedy type scheme to select the next node to branch. (C) 1997 Elsevi er Science B.V.