Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 30, Issue 2, Pages 309-320Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(01)00098-3
Keywords
scheduling; two-stage assembly flowshop; branch and bound algorithm; total weighted flowtime
Ask authors/readers for more resources
In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated into a branch and bound procedure. A heuristic procedure is also used to derive an initial upper bound. Computational results of the algorithm are presented.
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