点击次数：
论文类型：期刊论文
发表时间：2015-06-01
发表刊物：COMPUTERS & OPERATIONS RESEARCH
收录刊物：SCIE、EI、Scopus
卷号：58
页面范围：24-31
ISSN号：0305-0548
关键字：Scheduling; Flowshop; Learning effect; Heuristic algorithm; Branch-and-bound algorithm
摘要：In this paper, we study the problem of minimizing the weighted sum of makespan and total completion time in a permutation flowshop where the processing times are supposed to vary according to learning effects. The processing time of a job is a function of the sum of the logarithms of the processing times of the jobs already processed and its position in the sequence. We present heuristic algorithms, which are modified from the optimal schedules for the corresponding single machine scheduling problem and analyze their worst-case error bound. We also adopt an existing algorithm as well as a branch-and-bound algorithm for the general m-machine permutation flowshop problem. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems. (C) 2014 Elsevier Ltd. All rights reserved.