期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 53, 期 12, 页码 1367-1373出版社
PALGRAVE PUBLISHERS LTD
DOI: 10.1057/palgrave.jors.2601454
关键词
group scheduling; family set-up; makespan minimisation; branch-and-bound algorithm
This paper investigates a two-stage flowshop group scheduling problem with the objective of minimising makespan (the completion time of the last job). In the multiple-stage group scheduling, each job is generally classified into one family by considering its characteristics at all stages as a whole. However, in this study, each job is classified into multiple families, one family per stage. For this problem, two heuristics based on the branch-and-bound algorithm are constructed and their efficiencies are investigated.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据