.png){kind=icon}
.png){kind=icon}
Return
Multi-objective process planning and scheduling using controlled elitist non-dominated sorting genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2014.957872.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The integration of process planning and scheduling is considered as a critical component in manufacturing systems. In this paper, a multi-objective approach is used to solve the planning and scheduling problem. Three different objectives considered in this work are minimisation of makespan, machining cost and idle time of machines. To solve this integration problem, we propose an improved controlled elitist non-dominated sorting genetic algorithm (NSGA) to take into account the computational intractability of the problem. An illustrative example and five test cases have been taken to demonstrate the capability of the proposed model. The results confirm that the proposed multi-objective optimisation model gives optimal and robust solutions. A comparative study between proposed algorithm, controlled elitist NSGA and NSGA-II show that proposed algorithm significantly reduces scheduling objectives like makespan, cost and idle time, and is computationally more efficient.
Keywords:
controlled elitist NSGA
integrated process planning and scheduling
NSGA-II
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W