Process plan and scheduling integration for near optimal process plans in networked based manufacturing using controlled elitist NSGA-II and territory defining algorithms

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The networked based manufacturing offers various advantages in current competitive atmosphere by way to reduce the short manufacturing cycle time and to maintain the production flexibility. In this paper, we have addressed a multi-objective problem whose objectives are to minimize the makespan and maximization of machine utilization for generating feasible process plans of multiple jobs in the context of networked based manufacturing system. In more specific, with two powerful multi-objective evolutionary algorithms (MOEAs) namely controlled elitist-NSGA-II (CE-NSGA-II), and territory defining evolutionary algorithm (TDEA), were proposed to find the better performance of the system. With the help of an illustrative example along with two complex scenarios these algorithms has been implemented, tested and compared. Finally, the computational results are analyzed to the benefit of the manufacturer. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Manupati, V. K., Thakkar, J. J., Mohapatra, P., Kumar, A., & Tiwari, M. K. (2012). Process plan and scheduling integration for near optimal process plans in networked based manufacturing using controlled elitist NSGA-II and territory defining algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7677 LNCS, pp. 754–760). https://doi.org/10.1007/978-3-642-35380-2_88

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free