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

Authors: Yang Yu; Jiafu Tang; Yong Yin; Ikou Kaku

Addresses: Institute of System Engineering, Northeastern University, Heping, Snenyang, China ' College of Management Science and Engineering, Dongbei University of Finance and Economics (DUFE), Shahekou, Dalian, 116026, China ' The Graduate School of Business, Doshisha University, Karasuma Imadegawa, Kamigyo-ku, Kyoto 602-8580, Japan ' Department of Environmental Management, Tokyo City University, Ushikubonishi 3-3-1, Yokohama, 224-8551, Japan

Abstract: 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.

Keywords: line-seru conversion; comparison; seru loading; scheduling rules; performance improvement; assembly systems; serus; assembly line conversion; conveyor assembly lines.

DOI: 10.1504/AJMSA.2015.075337

Asian Journal of Management Science and Applications, 2015 Vol.2 No.2, pp.154 - 170

Received: 21 Jul 2015
Accepted: 19 Oct 2015

Published online: 15 Mar 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article