抄録
After a plan has been formed, it is often required to change the restrictions that were considered when the plan was formed. It is desired that new plan is similar to the initial plan, because change of preparation for a plan normally costs money and labor.
This paper proposes a partial plan set relaxation search method (PSRS method) for plan modification. This method can create the plan in which the initial plan is utilized, and modification costs is minimized. It divides whole search space into several partial plan sets, and narrows search space by “bounding operation”. It starts searching partial plan sets near the partial plan set which includes the initial plan, and then searches partial plan sets far from it. In this way, it can searches efficiently and selectively the plans near the initial plan. Applying the PSRS method to plan modification of a simple job shop problem, it has been obvious that the proposed method achieves a proper modification influenced by the difference value and the violation value.
