4.7 Article

Multi-population genetic algorithm with greedy job insertion inter-factory neighbourhoods for multi-objective distributed hybrid flow-shop scheduling with unrelated-parallel machines considering tardiness

Journal

Publisher

TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2023.2262616

Keywords

Distributed hybrid flow shop with unrelated parallel machines; Multi-objective scheduling considering total tardiness; Improved multi-population genetic algorithm; Greedy job insertion inter-factory neighbourhoods; Rapid evaluation method for inter-factory neighbourhoods; Sub-regional coevolution among multiple populations

Ask authors/readers for more resources

Distributed manufacturing is becoming a future trend. This study focuses on the multi-objective distributed hybrid flow shop scheduling problem with unrelated parallel machines. An improved multi-population genetic algorithm is proposed to solve the problem. Experimental results show that the proposed method outperforms existing algorithms and achieves significant improvements in a real-world manufacturing case.
Distributed manufacturing is gradually becoming the future trend. The fierce market competition makes manufacturing companies focus on productivity and product delivery. The hybrid flow shop scheduling problem (HFSP) is common in manufacturing. Considering the difference of machines at the same stage, the multi-objective distributed hybrid flow shop scheduling problem with unrelated parallel machines (MODHFSP-UPM) is studied with minimum makespan and total tardiness. An improved multi-population genetic algorithm (IMPGA) is proposed for MODHFSP-UPM. The neighbourhood structure is essential for meta-heuristic-based solving algorithms. The greedy job insertion inter-factory neighbourhoods and corresponding move evaluation method are designed to ensure the efficiency of local search. To enhance the optimisation ability and stability of IMPGA, sub-regional coevolution among multiple populations and re-initialisation procedure based on probability sampling are designed, respectively. In computational experiments, 120 instances (including the same proportion of medium and large-scale problems) are randomly generated. The IMPGA performs best in all indicators (spread, generational distance, and inverted generational distance), significantly outperforming existing efficient algorithms for MODHFSP-UPM. Finally, the proposed method effectively solves a polyester film manufacturing case, reducing the makespan and total tardiness by 40% and 60%, respectively.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available