A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Tozkapan A., Kirca O., Chung C.

COMPUTERS & OPERATIONS RESEARCH, vol.30, no.2, pp.309-320, 2003 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 30 Issue: 2
  • Publication Date: 2003
  • Doi Number: 10.1016/s0305-0548(01)00098-3
  • Journal Name: COMPUTERS & OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.309-320
  • Keywords: scheduling, two-stage assembly flowshop, branch and bound algorithm, total weighted flowtime, FLOWSHOP
  • Middle East Technical University Affiliated: No

Abstract

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.