A Novel Approach for the Process Planning and Scheduling Problem Using the Concept of Maximum Weighted Independent Set
Kai Sun

TL;DR
This paper introduces a new graph-based method for process planning and scheduling that directly finds optimal or near-optimal solutions efficiently by solving a maximum weighted independent set problem, improving over iterative methods.
Contribution
It formulates the PPS problem as a weighted graph and applies MWIS to achieve direct, efficient solutions with proven feasibility and near-optimality.
Findings
Successfully applied to real-world PPS instances
Achieves solutions with minimal iterations
Demonstrates scalability and robustness
Abstract
Process Planning and Scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research 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 paper, 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 is formulated into an undirected weighted conflicting graph, where nodes represent operations and their resources; edges represent constraints, and weight factors are guidelines for the node selection at each time slot. Then,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Assembly Line Balancing Optimization · Optimization and Packing Problems
