Applying an integer Electromagnetism-like algorithm to solve the cellular manufacturing scheduling problem with an integrated approach

Applying an integer Electromagnetism-like algorithm to solve the cellular manufacturing scheduling problem with an integrated approach
复制标题

DOI:
10.1109/iccie.2009.5223947
复制
发表时间:
2009-07
期刊:
2009 International Conference on Computers & Industrial Engineering
影响因子:
--
通讯作者:
Amirmohsen Golmohammadi;R. Ghodsi
Amirmohsen Golmohammadi;R. Ghodsi
中科院分区:
其他
文献类型:
--
作者:
Amirmohsen Golmohammadi;R. Ghodsi

文献摘要

被引文献

相似文献

在过去的二十年里,许多制造企业应用单元制造系统(CMS)来提高生产效率。单元制造是成组技术的一种应用。本文讨论了CM调度问题,这被认为是实施CMS的一个主要挑战。通过以往的研究,许多研究人员试图开发有效的模型和算法来解决这个问题。这些研究大多考虑的算法,调度的部分家庭和每个家庭的一部分,分别在两个步骤。在本文中,被认为是一个综合的方法,计划所有的部分,从所有的部分家庭在一个步骤,它是如何减少机器的空闲时间,从而减少了最大完工时间。为了解决这个调度问题的电磁(EM类)算法。此外,由于类EM算法最初是为具有真实的值数据的问题而设计的,因此需要对该算法进行修改以将其用于整数数据。所提出的算法的结果相比,到目前为止最好的算法之一,由其他研究人员的结果显示出重大的改善。
In the past two decades many manufacturing companies applied Cellular Manufacturing Systems (CMS) to improve their production. Cellular manufacturing (CM) is recognized as an application of Group Technology (GT). This paper deals with CM scheduling problem which is considered as a major challenge in implementation of the CMS. Through previous studies many researchers have attempted to develop effective models and algorithms to solve this problem. Most of these researches consider algorithms which schedule part families and the part of each family separately in two steps. In this paper an integrated approach is considered which schedules all parts from all part families in one step and it is demonstrated how this reduces the idle time of machines and consequently decreases the makespan. To solve this scheduling problem an Electromagnetism-like (EM-like) algorithm is employed. In addition, as EM-like algorithm was originally designed for problems with real value data, modification of the algorithm was necessary to use it with integer data. The results of the proposed algorithm show a major improvement when compared with the results of one of the so far best algorithms presented by other researchers.