Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A Discrete Electromagnetism-Like Mechanism Algorithm for Solving Distributed Permutation Flowshop Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hongcheng Liu ; State Key Lab. of Digital Manuf. Equip. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Liang Gao

A distributed permutation flow shop scheduling problem (DPFSP) is an NP-hard problem recently put forward in shop scheduling sphere. Exact algorithms for a DPFSP's solution can be extremely computationally costly. This paper proposes to apply an electromagnetism-like mechanism (EM) algorithm as a heuristic solution method to a DPFSP. To fit into the discrete domain of a DPFSP, modifications to the original EM algorithm, including redefinition of distance and movement and of charge and force calculation, have been made, to improve the performance of the proposed algorithm, a VNS local search mechanism employing the concept of the critical factory has been devised. The experimental results show the superiority of the proposed algorithm over the original EM algorithm. New best known solutions have been found to the Naderi's DPFSP benchmark suite adapted from Tail lard instances.

Published in:

Manufacturing Automation (ICMA), 2010 International Conference on

Date of Conference:

13-15 Dec. 2010