๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A very fast simulated re-annealing algorithm for the leather nesting problem

โœ Scribed by Z. Yuping; J. Shouwei; Z. Chunli

Publisher
Springer
Year
2004
Tongue
English
Weight
255 KB
Volume
25
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Productivity model for the cell formatio
Productivity model for the cell formation problem: A simulated annealing algorithm
โœ A.I. Abdelmola; S.M. Taboun ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 265 KB

A mathematical programming model is developed to identify machine groups and part families simultaneously using total productivity and an efficient simulated annealing algorithm is developed to solve large-seale problems. The test problem results showed the superiority of the algorithm over the math

A simulated annealing algorithm for the
A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts
โœ Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
โœ Taichi Kaji; Azuma Ohuchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this paper, we present an approach for ยฎnding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisยฎed, based on the concept of simulated annealing. Simulated anneali