A High Speed Planning Method by Grouping Jobs by Characteristic of Their Constraints in A Process Ordering Problem Using Spare Jobs

摘要

In this paper, we propose a method to rapidly decide process orders which satisfy all constraints by adding some jobs from a set of spare jobs to a large number of jobs which have the constraints about each connection between jobs. This problem can be divided into two parts of problem, namely a process ordering problem in each partial set which is easy to satisfy all the constrains, and an ordering problem among partial sets which is difficult to satisfy all the constraints, by grouping a set of jobs whose characteristic is similarity into partial sets.