2208 第2工程が複数台マシンを持つ2工程HFS(Hybrid Flowshop Scheduling)問題に対する最早開始時刻の連鎖割付の最適性の証明(OS9-1 システム最適化,OS9 システム最適化)

抄録

This research targets at the 2-stage HFS (Hybrid Flowshop Scheduling) Problem with multiple machines at the second stage. In order to make it possible that the algorithms for the problem is effectively searching the solution space, "Permutation Scheduling" for that problem, in which the jobs are assigned in the same starting order, is proposed. The proof that the optimal solution is included in the permutation scheduling is shown by using contradiction. In the proof, PERT (Project Evaluation Review Technique) diagram is used to compare the scheduling in and out of Permutation Schedule for the highlight of the difference between them.