Comparison of two typical scheduling rules of line-seru conversion problem

The complexity and the improved performance of line-seru conversion vary with the scheduling rules of seru loading. By combining the complexity of seru formation with the complexity of seru loading, this paper clarifies the combinatorial complexity of the line-seru conversion with two typical scheduling rules of first come first service (FCFS) and shortest processing time (SPT) in detail, and states complexity with FCFS is much more than that with SPT. However, by the numerical experiments we find that the performance improvement by line-seru conversion with FCFS is not much better than that with SPT. Therefore, it can be concluded that for decreasing the computational time SPT can be used as the typical scheduling rule in line-seru conversion problem.