Yanasse Horacio Hideki

Horacio Hideki Yanasse

Information about the author Horacio Hideki Yanasse will soon be added to the site.
Found 9 papers in total
The usable leftover one-dimensional cutting stock problem–a priority-in-use heuristic
The usable leftover one-dimensional cutting stock problem–a priority-in-use heuristic
2013
We consider a one‐dimensional cutting stock problem in which the material not...
A hybrid heuristic to reduce the number of different patterns in cutting stock problems
A hybrid heuristic to reduce the number of different patterns in cutting stock problems
2006
We propose a hybrid procedure to obtain a reduced number of different patterns in...
A method for solving the minimization of the maximum number of open stacks problem within a cutting process
A method for solving the minimization of the maximum number of open stacks problem within a cutting process
2004
In this paper, the problem of minimizing the maximum number of open stacks around a...
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
2002
The minimization of open stacks problem (MOSP) arises on the sequencing of a set of...
On a pattern sequencing problem to minimize the maximum number of open stacks
On a pattern sequencing problem to minimize the maximum number of open stacks
1997
Consider a wood cutting setting where different panels have to be cut from large...
Minimization of open orders – polynomial algorithms for some special cases
Minimization of open orders – polynomial algorithms for some special cases
1996
Consider a production system where a batch of tasks have to be performed. Once a task...
A search strategy for the one-size assortment problem
A search strategy for the one-size assortment problem
1994
The problem of determining the optimal length of a board with fixed width from which...
A polynomial approximation scheme for the subset sum problem
A polynomial approximation scheme for the subset sum problem
1995
The subset sum problem is defined as: given a set of n+1 positive integers, a 1...
EOQ systems: The case of an increase in purchase cost
EOQ systems: The case of an increase in purchase cost
1990
In an EOQ system, an anticipated price increase may require determination of an...
Papers per page: