王建军
点击次数：
论文类型：期刊论文
发表时间：2019-05-01
发表刊物：INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
收录刊物：SCIE、SSCI、Scopus
文献类型：J
卷号：26
期号：3
页面范围：1135-1151
ISSN号：0969-6016
关键字：scheduling; branch-and-bound algorithm; heuristic algorithm; learning effect; flow shop
摘要：The permutation flow shop problems with truncated exponential sum of logarithm processing times based and position-based learning effects are considered in this study. The objective is to minimize makespan and total weighted completion time, respectively. Several heuristics and a branch-and-bound algorithm are proposed in this paper. The tight worst-case bounds of some simple heuristics are also given. Numerical experiments are tested to evaluate the performance of the heuristics and branch-and-bound algorithm.
