Dynamic Programming to Minimize the Maximum Number of Open Stacks

References

• Becceneri J. C., Yannasse H. H., Soma N. Y. A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Comput. Oper. Res. (2004) 31:2315–2332Crossref, Google Scholar
• Constraint Modelling Challenge Constraint modelling challenge 2005. (2005) . http://www.dcs.st-and.ac.uk/∼ipg/challenge/Google Scholar
• Faggioli E., Bentivoglio C. A. Heuristic and exact methods for a cutting sequencing problem. Eur. J. Oper. Res. (1998) 110:564–575Crossref, Google Scholar
• Linhares A., Yanasse H. H. Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Comput. Oper. Res. (2002) 29:1759–1772Crossref, Google Scholar
• Yannasse H. H. On a pattern sequencing problem to minimize the maximum number of open stacks. Eur. J. Oper. Res. (1997) 100:454–463Crossref, Google Scholar
• Yuen B. J. Heuristics for sequencing cutting patterns. Eur. J. Oper. Res. (1991) 55:183–190Crossref, Google Scholar
• Yuen B. J. Improved heuristics for sequencing cutting patterns. Eur. J. Oper. Res. (1995) 87:57–64Crossref, Google Scholar
• Yuen B. J., Richardson K. V. Establishing the optimality of sequencing heuristics for cutting stock problems. Eur. J. Oper. Res. (1995) 84:590–598Crossref, Google Scholar