Akademik Veri Yönetim Sistemi
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, sa.1, ss.106-117, 2013 (SCI-Expanded)
The link between makespan and the profitability and competitiveness of a firm is addressed first. We then study the problem of minimising makespan in a two-machine flowshop with setup times. Jobs have random setup times that are bounded within certain intervals. The distributions of job setup times are not known. We propose a polynomial time algorithm that generalises Yoshida and Hitomi's algorithm. The algorithm uses a weighted average of lower and upper bounds for setup times. Different combinations of weights result in nine different versions of the algorithm. The computational results indicate that one of the versions, with equal weights given to the lower and upper bounds of setup times, performs much better than the others. Next, the performance of this best version is compared with that of the optimal solution, which is obtained by Yoshida and Hitomi's algorithm applied to the problem after setup times have been realised. Computational analysis shows that the overall average absolute error of the best algorithm is 0.03%, and this decreases in size as the number of jobs increases. The analysis also shows that the proposed best version yields robust results regardless of setup-time distributions and the range of setup times.