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

Productivity model for the cell formation problem: A simulated annealing algorithm

โœ Scribed by A.I. Abdelmola; S.M. Taboun

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
265 KB
Volume
37
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 mathematical programming model.

๐Ÿ“œ SIMILAR VOLUMES

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