Answers are grounded in this paper and cite their sources.
The multi-objective flexible job-shop scheduling problem with limited automated guided vehicles (MFJSPLA) focuses on integrating scheduling decisions with constrained automated guided vehicles (AGVs), considering transportation time. As AGVs are energy-intensive, improving their efficiency aids in reducing energy consumption, promoting green manufacturing. To solve this, we propose an improved non-dominated sorting genetic algorithm-II with neighbourhood search (INSGA-II_NS). The method includes a machine selection, operation sequencing and AGV selection representation encoding for mapping scheduling and allocation decisions; multiple heuristic operators to generate high-quality initial solutions and guide local search and a neighbourhood search mechanism within NSGA-II for optimal trade-off convergence. Experimental results show that INSGA-II_NS outperforms conventional multi-objective algorithms, demonstrating the effectiveness of the heuristic operators and neighbourhood search in improving solution quality and efficiency. This methodology is robust and practical for addressing complex scheduling challenges in advanced manufacturing systems.
No takes yet. Share an insight, caveat, or question.
Ning et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: