A hybrid electromagnetism-like algorithm for two-stage assembly flow shop scheduling problem

An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan

“…For the same problem, Liao and Liao (2007) presented an ant colony optimization (ACO) algorithm to solve the problem, and developed a branch and bound procedure to evaluate the performance of the algorithm. Yan, Wan, and Xiong (2014) dealt with a two-stage assembly flow shop scheduling problem for minimizing the weighed sum of maximum makespan, earliness and lateness. They proposed a hybrid variable neighborhood search -electromagnetism-like mechanism (VNS-EM) algorithm to solve the problem.…”

Spatial scheduling for large assembly blocks in shipbuilding

“…There are many different applications which require efficient scheduling algorithms with various constraints and characteristics (Kim and Moon, 2003;Kim et al, 2013;Nguyen and Yun, 2014;Yan et al, 2014). However, the spatial scheduling problem which considers spatial layout and dynamic job scheduling has not been studied extensively.…”

Coordinated scheduling of production and transportation in a two-stage assembly flowshop

“…For the same scheduling problem, Mozdgir et al (2013) integrated the variable neighbourhood search (VNS) with a novel heuristic to construct solutions. More recently, to further investigate the effectiveness of VNS, Yan, Wan, and Xiong (2014) hybridised VNS with the electromagnetism-like mechanism to guide the search beyond local optima. In addition, Navaei et al (2014) and Seidgar et al (2014) applied the ICA to schedule a two-stage assembly flowshop.…”