A method for solving the minimization of the maximum number of open stacks problem within a cutting process

Authors:
José Carlos Becceneri;Horacio Hideki Yanasse;Nei Yoshihiro Soma
Affiliations:
Laboratory for Computing and Applied Mathematics, Brazilian Space Research Institute, P.O. Box 515-INPE/LAC, São José dos Campos, SP, 12201-970, Brazil;Special Technologies Center, Brazilian Space Research Institute, P.O. Box 515-INPE/CTE, São José dos Campos, SP, 12201-970, Brazil;Aeronautic Institute of Technology, Aerospace Technical Center CTA/ITA/IEC, Pça. Mal. Eduardo Gomes, 50, Vila das Acácias, São José dos Campos, SP, 12228-900, Brazil
Venue:
Computers and Operations Research
Year:
2004

Citing 2
Cited 5

Applications of modern heuristic search methods to pattern sequencing problems

Computers and Operations Research
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines

Computers and Operations Research

Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem

Learning and Intelligent Optimization
Strips minimization in two-dimensional cutting stock of circular items

Computers and Operations Research
Minimizing the maximum number of open stacks by customer search

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Solving Talent Scheduling with Dynamic Programming

INFORMS Journal on Computing
On the one-dimensional stock cutting problem in the paper tube industry

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

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. Computational tests comparing the new approach with other algorithms previously suggested in the literature were carried out.