Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Solving Process Planning And Scheduling Problems Using The Concept Of Maximum Weighted Independent Set, Kai Sun
Dissertations - ALL
Process planning and scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research studies use iterative methods to solve such problems; however, they cannot achieve satisfactory results in both quality and computational speed. Other studies formulate scheduling problems as a graph coloring problem (GCP) or its extensions, but these formulations are limited to certain types of scheduling problems. In this dissertation, we propose a novel approach to formulate a general type of the PPS problem with resource allocation and process planning integrated towards a typical objective, minimizing the makespan. The PPS problem …