Buscar
Mostrando ítems 31-40 de 2636
The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic
(2013-03-01)
We consider a one-dimensional cutting stock problem in which the material not used in the cutting patterns, if large enough, is kept for use in the future. Moreover, it is assumed that leftovers should not remain in stock ...
The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic
(2013-03-01)
We consider a one-dimensional cutting stock problem in which the material not used in the cutting patterns, if large enough, is kept for use in the future. Moreover, it is assumed that leftovers should not remain in stock ...
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for ...
A multiple criteria heuristic solution method for locating near to optimal contiguous and compact sites in raster maps
(2011)
A high performance heuristic solution method is proposed able to locate near to optimal sites composed by a given number of cells (raster structure). These sites must be compact and maximize levels of the sites intrinsic ...
An application of a modified constructive heuristic algorithm to transmission expansion planning
(2011-10-05)
Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve ...
An application of a modified constructive heuristic algorithm to transmission expansion planning
(2011-10-05)
Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve ...
Fine Tuning Deep Boltzmann Machines Through Meta-Heuristic Approaches
(Ieee, 2018-01-01)
The Deep learning framework has been widely used in different applications from medicine to engineering. However, there is a lack of works that manage to deal with the issue of hyperparameter fine-tuning, since machine ...
Lagrangian heuristic for a class of the generalized assignment problems
(Pergamon-Elsevier B.V. Ltd, 2010-08-01)
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy ...