COMPUTERS & OPERATIONS RESEARCH, vol.30, no.2, pp.309-320, 2003 (Journal Indexed in SCI)
Article / Article
Title of Journal :
COMPUTERS & OPERATIONS RESEARCH
scheduling, two-stage assembly flowshop, branch and bound algorithm, total weighted flowtime, FLOWSHOP
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.