Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 53, Issue 12, Pages 1367-1373Publisher
PALGRAVE PUBLISHERS LTD
DOI: 10.1057/palgrave.jors.2601454
Keywords
group scheduling; family set-up; makespan minimisation; branch-and-bound algorithm
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available