期刊
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
卷 8, 期 3, 页码 366-387出版社
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2014.060997
关键词
flowshop scheduling; group scheduling; sequence-dependent setup time; branch and price; lower bound; metaheuristics
资金
- National Science Foundation (INSF) [90005394]
In this research, a permutation flowshop sequence-dependent group scheduling problem with minimisation of total completion time is considered. Since the problem is shown to be strongly NP-hard, a hybrid genetic (HG) algorithm is proposed. The only available lower bounding (LB) method for the proposed research problem in the literature based on branch and price (B&P) algorithm is also enhanced by proposing efficient method to solve sub-problems and proposing a better branching rule. A statistical comparison shows that both the proposed HG algorithm and the proposed LB have better performance than the other methods from the literature with an average 5.96% percentage gap.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据